Sciweavers

676 search results - page 117 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 1 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
14 years 1 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
IPCCC
2007
IEEE
14 years 1 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
ISRR
2005
Springer
111views Robotics» more  ISRR 2005»
14 years 1 months ago
Bias Reduction and Filter Convergence for Long Range Stereo
We are concerned here with improving long range stereo by filtering image sequences. Traditionally, measurement errors from stereo camera systems have been approximated as 3-D Gau...
Gabe Sibley, Larry Matthies, Gaurav S. Sukhatme
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 29 days ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...