Sciweavers

622 search results - page 102 / 125
» Understanding and Extending Graphplan
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...
ICFP
2007
ACM
14 years 8 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
WISE
2009
Springer
14 years 5 months ago
Spectral Clustering in Social-Tagging Systems
Social tagging is an increasingly popular phenomenon with substantial impact on the way we perceive and understand the Web. For the many Web resources that are not self-descriptive...
Alexandros Nanopoulos, Hans-Henning Gabriel, Myra ...
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 5 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer