973 search results - page 111 / 195 » New Bounds on Crossing Numbers |
153
click to vote
SIROCCO
2004
15 years 7 months ago
2004
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
160
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
187
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
189
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
173
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...