Sciweavers

4850 search results - page 951 / 970
» Proof and Computation in Geometry
Sort
View
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
15 years 5 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 5 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
SSD
2009
Springer
149views Database» more  SSD 2009»
15 years 5 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
MM
2009
ACM
160views Multimedia» more  MM 2009»
15 years 5 months ago
On statistical multiplexing of variable-bit-rate video streams in mobile systems
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...
Cheng-Hsin Hsu, Mohamed Hefeeda
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 5 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...