Sciweavers

1263 search results - page 2 / 253
» A* with Bounded Costs
Sort
View
ORL
2007
84views more  ORL 2007»
13 years 5 months ago
The price of anarchy in an exponential multi-server
We consider a single multi-server memoryless service station. Servers have heterogeneous service rates. Arrivals are routed to one of the servers, and the routing decisions are no...
Moshe Haviv, Tim Roughgarden
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 5 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
ARSCOM
2007
76views more  ARSCOM 2007»
13 years 5 months ago
A New Lower Bound for A(17, 6, 6)
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
Yeow Meng Chee
CVPR
2000
IEEE
14 years 7 months ago
A Formal Classification of 3D Medial Axis Points and Their Local Geometry
This paper proposes a novel hypergraph skeletal representation for 3D shape based on a formal derivation of the generic structure of its medial axis. By classifying each skeletal ...
Peter J. Giblin, Benjamin B. Kimia
COMPGEOM
1992
ACM
13 years 9 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl