Sciweavers

2252 search results - page 410 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
DAC
2010
ACM
14 years 22 days ago
LUT-based FPGA technology mapping for reliability
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
Jason Cong, Kirill Minkovich
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 9 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 8 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 3 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu