Sciweavers

315 search results - page 35 / 63
» Eigenvalue bounds for independent sets
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ICRA
2007
IEEE
111views Robotics» more  ICRA 2007»
14 years 4 months ago
Upper body posture estimation for standing function restoration
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...
Gael Pages, Nacim Ramdani, Philippe Fraisse, David...
LICS
2007
IEEE
14 years 4 months ago
Locally Excluding a Minor
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
Anuj Dawar, Martin Grohe, Stephan Kreutzer
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 2 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
ICDCS
2008
IEEE
14 years 4 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao