Sciweavers

5580 search results - page 885 / 1116
» Randomized priority algorithms
Sort
View
95
Voted
SIGIR
2002
ACM
15 years 2 months ago
Predicting query performance
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft
118
Voted
TSMC
2002
110views more  TSMC 2002»
15 years 2 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
CVPR
2009
IEEE
16 years 8 months ago
D - Clutter: Building object model library from unsupervised segmentation of cluttered scenes
Autonomous systems which learn and utilize a limited visual vocabulary have wide spread applications. Enabling such systems to segment a set of cluttered scenes into objects is ...
Chandra Kambhamettu, Dimitris N. Metaxas, Gowri So...
CORR
2010
Springer
123views Education» more  CORR 2010»
15 years 1 months ago
Feature Construction for Relational Sequence Learning
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
93
Voted
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 27 days ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake