Sciweavers

8298 search results - page 1302 / 1660
» On the Complexity of Numerical Analysis
Sort
View
MOBIHOC
2006
ACM
16 years 6 months ago
MLS: : an efficient location service for mobile ad hoc networks
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
Roland Flury, Roger Wattenhofer
EWSN
2007
Springer
16 years 6 months ago
Removing Systematic Error in Node Localisation Using Scalable Data Fusion
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
Albert Krohn, Mike Hazas, Michael Beigl
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 4 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 4 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen

Publication
309views
16 years 4 months ago
Improving Nearest Neighbor Classification with Cam Weighted Distance
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Changyin Zhou, Yanqiu Chen
« Prev « First page 1302 / 1660 Last » Next »