Sciweavers

327 search results - page 59 / 66
» Algorithms for infinite huffman-codes
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 7 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
IUI
2005
ACM
14 years 8 days ago
Intelligent data entry assistant for XML using ensemble learning
XML has emerged as the primary standard of data representation and data exchange [13]. Although many software tools exist to assist the XML implementation process, data must be ma...
Danico Lee, Costas Tsatsoulis
ALT
2003
Springer
13 years 10 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
MICCAI
2006
Springer
14 years 7 months ago
Fiber Bundle Estimation and Parameterization
Individual white matter fibers cannot be resolved by current magnetic resonance (MR) technology. Many fibers of a fiber bundle will pass through an individual volume element (voxel...
Marc Niethammer, Sylvain Bouix, Carl-Fredrik Westi...