新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

geomblog library [125 articles]

最近 geomblog さんのライブラリ .
  • Building triangulations using &\#949;-nets
    (2006), pp. 326-335.
    by Kenneth L Clarkson
    posted to symmetry by geomblog on 2006-09-08 06:38:14 as ** along with 1 person NeilInCanadia
  • Smooth invariant interpolation of rotations
    ACM Trans. Graph., Vol. 16, No. 3. (July 1997), pp. 277-295.
    by FC Park, Bahram Ravani
    posted to symmetry by geomblog on 2006-09-08 06:37:32 as ** along with 1 person gane5h
  • Riemannian Geometries on Spaces of Plane Curves (ResearchIndex)
    posted to shape by geomblog on 2006-07-21 15:24:49 as **
  • Linear programming and convex hulls made easy
    (1990), pp. 211-215.
    by Raimund Seidel
    posted to bregmanclustering by geomblog on 2006-07-14 20:49:14 as **
  • Image Similarity Using Mutual Information of Regions
    by Daniel B Russakoff, Carlo Tomasi, Torsten Rohlfing, Calvin R Maurer, Jr
    posted to bregmanclustering by geomblog on 2006-07-13 18:59:39 as **
  • A Subexponential Bound for Linear Programming
    (1992), pp. 1-8.
    by Jiri Matousek, Micha Sharir, Emo Welzl
    posted to bregmanclustering by geomblog on 2006-07-10 21:24:43 as **
  • Algebraic Topology and Distributed Computing: A Primer
    (1995), pp. 203-217.
    by Maurice Herlihy, Sergio Rajsbaum
    posted to surveys by geomblog on 2006-07-06 13:38:40 as ** along with 5 people and 4 groups ansobol jrw euclid gane5h meisner Algorithms metric_embeddings TCS Polytopes
  • Las Vegas algorithms for linear and integer programming when the dimension is small
    J. ACM, Vol. 42, No. 2. (March 1995), pp. 488-499.
    by Kenneth L Clarkson
    posted to bregmanclustering by geomblog on 2006-06-25 06:51:07 as **
  • Topological Persistence and Simplification
    Discrete and Computational Geometry, Vol. 28, No. 4. (November 2002), pp. 511-533.
    by Herbert Edelsbrunner, David Letscher, Afra Zomorodian
    posted to persistence by geomblog on 2006-06-12 03:43:17 as **
  • Closest-Point Problems in Computational Geometry
    (1997)
    by M Smid
    edited by J Sack
    posted to surveys by geomblog on 2006-05-16 04:42:48 as ** along with 4 people ansobol anoopsarkar jrw gane5h
  • Three views of LP-type optimization problems
    by Jiri Matousek, Petr Skovron
    posted to clustering by geomblog on 2006-05-12 13:44:16 as **
  • The complexity of perfect zero-knowledge
    (1987), pp. 204-209.
    by L Fortnow
    posted to szk by geomblog on 2006-04-07 22:47:32 as **
  • Statistical Zero-Knowledge Languages can be Recognized in Two Rounds
    Journal of Computer and System Sciences, Vol. 42, No. 3. (1991), pp. 327-345.
    by William Aiello, Johan Hastad
    posted to szk by geomblog on 2006-04-07 22:46:13 as **
  • A Complete Promise Problem for Statistical Zero-Knowledge
    (1997)
    by Sahai, Vadhan
    posted to szk by geomblog on 2006-04-07 22:44:31 as **
  • Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK
    Electronic Colloquium on Computational Complexity (ECCC), Vol. 5, No. 063. (1998)
    by Oded Goldreich, Salil P Vadhan
    posted to szk by geomblog on 2006-04-07 22:44:06 as **
  • When is a Function a Fold or an Unfold?
    Vol. 44(1) (2001)
    by Jeremy Gibbons, Graham Hutton, Thorsten Altenkirch
    edited by Andrea Corradini, Marina Lenisa, Ugo Montanari
    posted to gpgpu streams by geomblog on 2006-03-30 21:18:51 as **
  • How many clusters? An information theoretic perspective
    (14 May 2004)
    by Susanne Still, William Bialek
    posted to informationbottleneck by geomblog on 2006-03-05 07:26:56 as **
  • Design Flaws in the Implementation of the Ziggurat and Monty Python methods (and some remarks on Matlab randn)
    (2 Mar 2006)
    by Boaz Nadler
    posted to sampling by geomblog on 2006-03-03 20:01:51 as **
  • Random sampling with a reservoir
    ACM Trans. Math. Softw., Vol. 11, No. 1. (March 1985), pp. 37-57.
    by Jeffrey S Vitter
    posted to randomsampling streams by geomblog on 2006-02-13 15:50:13 as ** along with 3 people mapio leonardo boila
  • Reservoir-sampling algorithms of time complexity <italic>O</italic>(<italic>n</italic>(1 + log(<italic>N</italic>/<italic>n</italic>)))
    ACM Trans. Math. Softw., Vol. 20, No. 4. (December 1994), pp. 481-493.
    by Kim-Hung Li
    posted to randomsampling streams by geomblog on 2006-02-13 15:49:25 as ***
  • Fisher information matrix and hyperbolic geometry
    Information Theory Workshop, 2005 IEEE (2005), pp. 28-30.
    by SIR Costa, SA Santos, JE Strapasson
    posted to no-tag by geomblog on 2006-02-04 18:01:17 as **
  • Lower bounds for one-way probabilistic communication complexity and their application to space complexity
    Theoretical Computer Science, Vol. 157, No. 2. (1996), pp. 139-159.
    by Farid Ablayev
    posted to informationtheory streaming by geomblog on 2006-01-31 18:03:11 as **
  • Privacy, additional information and communication
    Information Theory, IEEE Transactions on, Vol. 39, No. 6. (1993), pp. 1930-1943.
    by R Bar-Yehuda, B Chor, E Kushilevitz, A Orlitsky
    posted to informationtheory streaming by geomblog on 2006-01-31 17:53:38 as **
  • Shannon Information and Kolmogorov Complexity
    (1 October 2004)
    by Peter Grunwald, Paul Vitanyi
    posted to complexity informationtheory by geomblog on 2006-01-26 16:32:08 as ** along with 16 people and 8 groups quianominorleo camster adg marciolima JimG yish ddahlem pverstra madhadron scis0000001 rgb remipannequin csolar1971 neilc rsantana balduzzi dbk-lab mathgamespatterns dtl vds-arg eni macc pileWorks Holonic_Tracilog_Team
  • MIXTURE DENSITIES, MAXIMUM LIKELIHOOD AND THE EM ALGORITHM
    SIAM Review, Vol. 26, No. 2. (1984), pp. 195-239.
    by R Redner, H Walker
    posted to softclustering by geomblog on 2006-01-18 19:25:52 as **
  • Deterministic annealing for clustering, compression, classification, regression, and related optimization problems
    (1998)
    by K Rose
    posted to softclustering by geomblog on 2006-01-18 19:11:35 as ** along with 2 people and 1 group ecome anon_pl LTN
  • The Geometry of Logconcave functions and Sampling Algorithms
    (2005)
    by Laszlo Lovasz, Santosh Vempala
    posted to informationgeometry by geomblog on 2006-01-18 18:35:25 as **
  • A direct sum theorem in communication complexity via message compression
    (14 Apr 2003)
    by Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    posted to discrepancy streaming by geomblog on 2006-01-14 07:47:22 as **
  • Two applications of information complexity
    (2003)
    by T Jayram, R Kumar, D Sivakumar
    posted to discrepancy streaming by geomblog on 2006-01-14 07:45:26 as **
  • Kolmogorov complexity and computational complexity
    (2004)
    by L Fortnow
    posted to complexity survey by geomblog on 2006-01-14 06:48:07 as ** along with 3 people and 1 group rgb rsantana suizan pileWorks
  • An information statistics approach to data stream and communication complexity
    (2002)
    by Bar Z Yossef, T Jayram, R Kumar, D Sivakumar
    posted to discrepancy streaming by geomblog on 2006-01-14 06:38:49 as ** along with 1 person boila
  • Competitive recommendation systems
    (2002), pp. 82-90.
    by Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan
    posted to tags by geomblog on 2006-01-11 08:36:17 as **
  • Kantorovich metric:initial history and little-known applications
    (5 March 2005)
    by Vershik
    posted to tags by geomblog on 2006-01-06 06:47:25 as ** along with 1 person ansobol
  • Quantum Communication Complexity (A Survey)
    (1 Jan 2001)
    by Gilles Brassard
    posted to quantum by geomblog on 2005-12-29 16:57:27 as ** along with 3 people itmeson BarrosH kevina
  • General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
    Information Theory, IEEE Transactions on, Vol. 36, No. 1. (1990), pp. 23-30.
    by LK Jones, CL Byrne
    posted to informationgeometry by geomblog on 2005-12-28 15:37:20 as **
  • Information Geometry and Maximum Likelihood Criteria
    by William Byrne
    posted to informationgeometry by geomblog on 2005-12-28 01:02:49 as **
  • Information Geometry of the EM and em Algorithms for Neural Networks
    Neural Networks, Vol. 8, No. 9. (1995), pp. 1379-1408.
    by Shun I Amari
    posted to informationgeometry by geomblog on 2005-12-28 01:00:38 as *****
  • Quantization
    by R Gray, D Neuhoff
    posted to quantization by geomblog on 2005-12-25 06:13:29 as **
  • Noninformative Priors Do Not Exist: A Discussion with Jose M. Bernardo
    posted to no-tag by geomblog on 2005-12-18 07:05:56 as ** along with 1 person yaroslavvb
  • Probabilities and Statistics on Riemannian Manifolds : A Geometric approach
    by Pennec
    posted to geometry manifold by geomblog on 2005-12-12 06:40:19 as ** along with 1 person yaroslavvb
  • Space lower bounds for distance approximation in the data stream model
    (2002), pp. 360-369.
    by Michael Saks, Xiaodong Sun
    posted to communicationcomplexity streams by geomblog on 2005-12-11 05:58:40 as ** along with 1 person boila
  • Introduction to Grassmann Manifolds and Quantum Computation
    (10 Jul 2002)
    by Kazuyuki Fujii
    posted to reading by geomblog on 2005-12-11 04:01:41 as *** along with 2 people ansobol jrw
  • Some complexity questions related to distributive computing(Preliminary Report)
    (1979), pp. 209-213.
    by Andrew C Yao
    posted to communicationcomplexity by geomblog on 2005-12-10 22:19:29 as ** along with 1 person huangxl
  • On the Complexity of Real Functions
    Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on (2005), pp. 155-164.
    by M Braverman
    posted to reading by geomblog on 2005-12-09 06:11:41 as **
  • Multi-pass geometric algorithms
    (2005), pp. 180-189.
    by Timothy M Chan, Eric Y Chen
    posted to randomstreams by geomblog on 2005-12-02 23:55:46 as ***
  • On lazy randomized incremental construction
    (1994), pp. 105-114.
    by Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
    posted to randomstreams by geomblog on 2005-12-02 23:55:00 as ***
  • Pattern Recognition with Fuzzy Objective Function Algorithms (Advanced Applications in Pattern Recognition)
    (31 July 1981)
    by James C Bezdek
    posted to softclustering by geomblog on 2005-11-28 06:04:04 as ** along with 2 people and 1 group voiklis charlottejv ColDyn
  • Elements of information theory
    (1991)
    by Thomas M Cover, Joy A Thomas
    posted to informationtheory by geomblog on 2005-11-28 04:23:14 as ** along with 3 people davidbrooks ajaiswal roys
  • Distributional clustering of words for text classification
    (1998), pp. 96-103.
    by Douglas L Baker, Andrew K Mccallum
    posted to informationbottleneck by geomblog on 2005-11-28 04:22:54 as **
  • Estimating mutual information and multi--information in large networks
    (3 Feb 2005)
    by Noam Slonim, Gurinder S Atwal, Gasper Tkacik, William Bialek
    posted to estimation mutualinformation by geomblog on 2005-11-28 04:12:07 as ** along with 3 people bayesian balicea kvorg
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/geomblog

    Result page: 1 2 3 Next RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.