Sciweavers

2911 search results - page 363 / 583
» A Logic of Graph Constraints
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 6 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
16 years 1 months ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés
CP
2005
Springer
16 years 3 days ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...