2107 search results - page 94 / 422 » Computing Small Search Numbers in Linear Time |
183
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
180
click to vote
CSL
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
163
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
136
click to vote
CGF
2010
15 years 6 months ago
2010
We present an automatic image-recoloring technique for enhancing color contrast for dichromats whose computational cost varies linearly with the number of input pixels. Our approa...
167
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...