Sciweavers

868 search results - page 35 / 174
» A general compression algorithm that supports fast searching
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 1 months ago
A Fast and Adaptive Test of Static Equilibrium for Legged Robots
— A legged robot walking on uneven terrain can avoid falling only by applying contact forces with its feet on the ground that compensate for gravity without causing slip. To plan...
Timothy Bretl, Sanjay Lall
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 2 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
SIGIR
2000
ACM
14 years 1 days ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 1 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher