2774 search results - page 123 / 555 » Exploiting Deep Structure |
151
click to vote
CRV
2008
IEEE
15 years 11 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
155
click to vote
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
In epidemic or gossip-based multicast protocols, each node simply relays each message to some random neighbors, such that all destinations receive it at least once with high proba...
131
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
130
click to vote
MTV
2005
IEEE
15 years 10 months ago
2005
IEEE
The increasing complexity and size of system level design models introduces a difficult challenge for validating them. Hence, in most industries, design validation takes a large p...
151
click to vote
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...