Sciweavers

2412 search results - page 262 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
144
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
176
Voted
SIAMSC
2011
177views more  SIAMSC 2011»
14 years 10 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
113
Voted
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 1 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
122
Voted
SPAA
2003
ACM
15 years 9 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
125
Voted
JOT
2008
122views more  JOT 2008»
15 years 3 months ago
UML and Object Oriented Drama
Readers of this article have probably seen, at least once, diagrams produced using the UML (Unified Modeling Language). Some of you have perhaps used UML for your own work and kno...
Luca Vetti Tagliati, Carlo Caloro