1431 search results - page 7 / 287 » The complexity of random ordered structures |
ISAAC
1995
Springer
13 years 11 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
CVPR
2007
IEEE
2007
IEEE
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
14 years 9 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...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We address in this paper the problem of segmenting complex handritten pages such as novelist drafts or authorial manuscripts. We propose to use stochastic and contextual models in...