1376 search results - page 142 / 276 » Searching Trees: An Essay |
159
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
174
click to vote
SIGIR
2005
ACM
16 years 13 hour ago
2005
ACM
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
174
click to vote
BTW
2005
Springer
16 years 3 hour ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
183
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
321
click to vote
ICDE
1996
IEEE
16 years 7 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...