2485 search results - page 157 / 497 » Time Bounded Frequency Computations |
145
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
The front end of many motion analysis algorithms is usually a process that generates bounding boxes around each moving object, roughly segmenting the objects from the background. ...
151
click to vote
UAI
2004
15 years 6 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
147
click to vote
RT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We present a new data structure for encoding the appearance of a geometric model as seen from a viewing region (view cell). This representation can be used in interactive...
164
click to vote
SIGGRAPH
1996
ACM
15 years 9 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
136
click to vote
TCS
2008
15 years 5 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...