11328 search results - page 195 / 2266 » Timed Branching Processes |
145
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
112
click to vote
ICCAD
2007
IEEE
16 years 19 days ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
121
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
111
click to vote
ISMIR
2001
Springer
15 years 8 months ago
2001
Springer
The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, includin...
131
Voted
ADBIS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure s...