Sciweavers

13603 search results - page 250 / 2721
» On the Complexity of Computing Treelength
Sort
View
COMPGEOM
2001
ACM
15 years 9 months ago
Hierarchical morse complexes for piecewise linear 2-manifolds
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
Herbert Edelsbrunner, John Harer, Afra Zomorodian
CVPR
2007
IEEE
16 years 8 months ago
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
Benjamin Laxton, Jongwoo Lim, David J. Kriegman
HPCA
2003
IEEE
16 years 6 months ago
Reconsidering Complex Branch Predictors
To sustain instruction throughput rates in more aggressively clocked microarchitectures, microarchitects have incorporated larger and more complex branch predictors into their des...
Daniel A. Jiménez
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 6 days ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
SIGOPSE
2004
ACM
15 years 11 months ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein