658 search results - page 38 / 132 » Lower bounds for sorting networks |
JCSS
2007
13 years 7 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
PVLDB
2010
13 years 6 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
NIPS
2003
13 years 9 months ago
2003
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...