Sciweavers

4009 search results - page 506 / 802
» Clustering on Complex Graphs
Sort
View
FOCS
1993
IEEE
15 years 10 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
CORR
2006
Springer
116views Education» more  CORR 2006»
15 years 6 months ago
Memory Aware High-Level Synthesis for Embedded Systems
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
Gwenolé Corre, Eric Senn, Nathalie Julien, ...
JAIR
2008
111views more  JAIR 2008»
15 years 6 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak

Publication
295views
14 years 4 months ago
The Age of Analog Networks.
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
Claudio Mattiussi, Daniel Marbach, Peter Dürr, Da...
ECCV
2006
Springer
16 years 8 months ago
A Multiview Approach to Tracking People in Crowded Scenes Using a Planar Homography Constraint
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
Saad M. Khan, Mubarak Shah