Sciweavers

4212 search results - page 97 / 843
» On Compressible Pairings and Their Computation
Sort
View
ECCC
1998
88views more  ECCC 1998»
15 years 6 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
16 years 13 days ago
GPCD: Grid-based Predictive Collision Detection for Large-scale Environments in Computer Games
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
Zhiwen Yu, Hau-San Wong
COMPUTER
2000
65views more  COMPUTER 2000»
15 years 6 months ago
Compression: A Key for Next-Generation Text Retrieval Systems
Nivio Ziviani, Edleno Silva de Moura, Gonzalo Nava...
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
15 years 10 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan
DCC
2011
IEEE
15 years 1 months ago
Deplump for Streaming Data
We present a general-purpose, lossless compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the infere...
Nicholas Bartlett, Frank Wood