5115 search results - page 584 / 1023 » On Randomized Lanczos Algorithms |
208
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
176
click to vote
CCS
2001
ACM
15 years 11 months ago
2001
ACM
We propose a novel and robust hashing paradigm that uses iterative geometric techniques and relies on observations that main geometric features within an image would approximately ...
159
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
180
click to vote
PAKDD
2001
ACM
15 years 11 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
186
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...