14774 search results - page 482 / 2955 » Computational complexity and evolutionary computation |
173
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
172
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
170
Voted
ERSHOV
2003
Springer
16 years 2 days ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
178
Voted
ICALP
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
190
Voted
ICPR
2010
IEEE
16 years 8 hour ago
2010
IEEE
—Captions in videos play a significant role for automatically understanding and indexing video content, since much semantic information is associated with them. This paper presen...