26 search results - page 5 / 6 » The minimal covering set in large tournaments |
WEBDB
2007
Springer
14 years 3 months ago
2007
Springer
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
RAID
2004
Springer
14 years 3 months ago
2004
Springer
Worm detection systems have traditionally used global strategies and focused on scan rates. The noise associated with this approach requires statistical techniques and large data s...
JCSS
2008
13 years 9 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...