Sciweavers

5019 search results - page 932 / 1004
» On the Reflexivity of Point Sets
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
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:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
HASE
2008
IEEE
15 years 4 months ago
Localizing Program Errors via Slicing and Reasoning
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....
Fei Pu, Yan Zhang
ICC
2008
IEEE
115views Communications» more  ICC 2008»
15 years 4 months ago
Oblivious Routing for Wireless Mesh Networks
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
Jonathan Wellons, Yuan Xue
ICRA
2008
IEEE
190views Robotics» more  ICRA 2008»
15 years 4 months ago
Auditory mood detection for social and educational robots
— Social robots face the fundamental challenge of detecting and adapting their behavior to the current social mood. For example, robots that assist teachers in early education mu...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
15 years 4 months ago
A Bayesian approach to empirical local linearization for robotics
— 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...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...