Sciweavers

1029 search results - page 138 / 206
» Compact representations of ordered sets
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
AIPS
2008
14 years 9 days ago
Generative Planning for Hybrid Systems Based on Flow Tubes
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
Hui X. Li, Brian C. Williams
NIPS
2008
13 years 11 months ago
Grouping Contours Via a Related Image
Contours have been established in the biological and computer vision literature as a compact yet descriptive representation of object shape. While individual contours provide stru...
Praveen Srinivasan, Liming Wang, Jianbo Shi
ANOR
2005
131views more  ANOR 2005»
13 years 10 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
TKDE
2011
332views more  TKDE 2011»
13 years 4 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose