Sciweavers

214 search results - page 35 / 43
» Perfect and Almost Perfect Sequences
Sort
View
126
Voted
FOCS
2005
IEEE
15 years 9 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
131
Voted
LCPC
2005
Springer
15 years 9 months ago
Analytic Models and Empirical Search: A Hybrid Approach to Code Optimization
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they reflect their implementor’s understanding and beliefs ...
Arkady Epshteyn, María Jesús Garzar&...
139
Voted
SIGCOMM
2004
ACM
15 years 9 months ago
A comparison of overlay routing and multihoming route control
The limitations of BGP routing in the Internet are often blamed for poor end-to-end performance and prolonged connectivity interruptions. Recent work advocates using overlays to e...
Aditya Akella, Jeffrey Pang, Bruce M. Maggs, Srini...
161
Voted
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 8 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
147
Voted
WLP
1997
Springer
15 years 7 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye