Sciweavers

440 search results - page 48 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
AAAI
2007
13 years 10 months ago
Topological Mapping with Weak Sensory Data
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
Gregory Dudek, Dimitri Marinakis
APWEB
2003
Springer
13 years 11 months ago
Mining "Hidden Phrase" Definitions from the Web
Keyword searching is the most common form of document search on the Web. Many Web publishers manually annotate the META tags and titles of their pages with frequently queried phras...
Hung V. Nguyen, P. Velamuru, Deepak Kolippakkam, H...
ICCV
1999
IEEE
14 years 10 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICCV
2005
IEEE
14 years 1 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 8 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo