13621 search results - page 211 / 2725 » Computability and Complexity in Self-assembly |
157
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
174
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
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...
148
click to vote
CVPR
2007
IEEE
2007
IEEE
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
16 years 8 months ago
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...
146
click to vote
HPCA
2003
IEEE
16 years 6 months ago
2003
IEEE
To sustain instruction throughput rates in more aggressively clocked microarchitectures, microarchitects have incorporated larger and more complex branch predictors into their des...
168
click to vote
ICC
2007
IEEE
16 years 26 days ago
2007
IEEE
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...