13603 search results - page 334 / 2721 » On the Computational Complexity of Cut-Reduction |
190
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...
183
click to vote
ERSHOV
2003
Springer
16 years 21 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.
194
click to vote
ICALP
2003
Springer
16 years 20 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.
212
click to vote
ICPR
2010
IEEE
16 years 18 days 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...
205
click to vote
ITIIS
2008
15 years 7 months ago
2008
Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but...