Sciweavers

13603 search results - page 262 / 2721
» On the Complexity of Computing Treelength
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 6 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
TCS
2008
15 years 5 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
ICCV
2009
IEEE
16 years 11 months ago
Action Detection in Complex Scenes with Spatial and Temporal Ambiguities
In this paper, we investigate the detection of semantic human actions in complex scenes. Unlike conventional action recognition in well-controlled environments, action detection...
Yuxiao Hu, Liangliang Cao, Fengjun Lv, Shuicheng Y...
ICPR
2004
IEEE
16 years 7 months ago
Multi-View Face Detection under Complex Scene based on Combined SVMs
A single face classifier has difficulty in detecting multiview faces under real and complex scenes due to various poses, cluttering environment and small size of faces. In this pa...
Peng Wang, Qiang Ji
DCC
2009
IEEE
16 years 6 months ago
H.264/MPEG-4 AVC Encoder Parameter Selection Algorithms for Complexity Distortion Tradeoff
The H.264 encoder has input parameters that determine the bit rate and distortion of the compressed video and the encoding complexity. A set of encoder parameters is referred to a...
Rahul Vanam, Eve A. Riskin, Richard E. Ladner