Sciweavers

928 search results - page 34 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
MFCS
2007
Springer
14 years 3 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
MM
2005
ACM
87views Multimedia» more  MM 2005»
14 years 2 months ago
Toward emergent representations for video
Advanced systems for finding, using, sharing, and remixing video require high-level representations of video content. A number of researchers have taken top-down, analytic approac...
Ryan Shaw, Marc Davis
DAC
2003
ACM
14 years 10 months ago
An adaptive window-based susceptance extraction and its efficient implementation
The determination of the set (or window) of segments that are inductively coupled to a significant degree with a given segment plays a fundamental role in window-based techniques ...
Guoan Zhong, Cheng-Kok Koh, Venkataramanan Balakri...
CCS
2007
ACM
14 years 3 months ago
Analyzing the vulnerability of superpeer networks against attack
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...
ICRA
2002
IEEE
86views Robotics» more  ICRA 2002»
14 years 1 months ago
Optimized Binary Modular Reconfigurable Robotic Devices
—Binary robotic devices with large degrees of freedom have been proposed by a number of researchers. However, experimental implementations of these concepts have been built with ...
Moustapha Hafez, Matthew D. Lichter, Steven Dubows...