7129 search results - page 1176 / 1426 » Approximation Algorithms for Treewidth |
120
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
141
click to vote
ISSTA
2009
ACM
15 years 9 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
143
Voted
MIR
2010
ACM
15 years 9 months ago
2010
ACM
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
159
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
140
click to vote
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...