562 search results - page 97 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
UAI
2004
13 years 9 months ago
2004
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
ALGORITHMICA
1998
13 years 8 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
SIGGRAPH
1997
ACM
14 years 14 hour ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
UIST
2010
ACM
13 years 6 months ago
2010
ACM
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...