2485 search results - page 9 / 497 » Time Bounded Frequency Computations |
110
click to vote
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
81
Voted
UC
2005
Springer
15 years 5 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
94
Voted
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
100
click to vote
WCNC
2010
IEEE
15 years 3 months ago
2010
IEEE
—It is well known that symbol timing offsets larger than the cyclic prefix as well as carrier frequency offsets between transmitter and receiver stations destroy the orthogonali...