Sciweavers

1011 search results - page 91 / 203
» The three dimensions of proofs
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
ICALP
2007
Springer
16 years 16 days ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 11 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
PCM
2004
Springer
171views Multimedia» more  PCM 2004»
15 years 11 months ago
SketchIt: Basketball Video Retrieval Using Ball Motion Similarity
Abstract. A prototype basketball video retrieval system is presented in this report. Retrieval is based on the similarity of ball motion in the clip with that in the query. The sys...
Sitaram Bhagavathy, Motaz A. El Saban
COLT
2000
Springer
15 years 10 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...