Sciweavers

4860 search results - page 96 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ICRA
2007
IEEE
115views Robotics» more  ICRA 2007»
14 years 2 months ago
Sensor Selection Using Information Complexity for Multi-sensor Mobile Robot Localization
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....
INFOCOM
2007
IEEE
14 years 2 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
IPL
2008
135views more  IPL 2008»
13 years 7 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
DAGM
2003
Springer
14 years 29 days ago
Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
Ivan Kovtun