Sciweavers

1132 search results - page 165 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
PVLDB
2010
84views more  PVLDB 2010»
15 years 4 months ago
Processing Top-k Join Queries
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...
Minji Wu, Laure Berti-Equille, Amélie Maria...
COLT
2010
Springer
15 years 4 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 3 months ago
Two-Way Transmission Capacity of Wireless Ad-hoc Networks
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...
Rahul Vaze, Kien T. Truong, Steven Weber, Robert W...
CORR
2011
Springer
243views Education» more  CORR 2011»
15 years 1 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
TIT
2010
90views Education» more  TIT 2010»
15 years 1 months ago
Correcting limited-magnitude errors in the rank-modulation scheme
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
Itzhak Tamo, Moshe Schwartz