2107 search results - page 232 / 422 » Computing Small Search Numbers in Linear Time |
P2P
2009
IEEE
14 years 4 months ago
2009
IEEE
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on IDmatching. Many previous works and measurements on Kad do not take into account that...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
COMPGEOM
2000
ACM
14 years 1 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
AIPS
2006
13 years 10 months ago
2006
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...