2635 search results - page 38 / 527 » Algorithms for the Database Layout Problem |
111
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper presents a new method for segmenting and recognizing Chinese handwritten address character strings. First, a dissection algorithm is applied to over-segment string imag...
120
click to vote
DL
2000
Springer
15 years 6 months ago
2000
Springer
The paper introduces an approach that organizes retrieval results semantically and displays them spatially for browsing. Latent Semantic Analysis as well as cluster techniques are...
126
click to vote
DAC
2012
ACM
13 years 4 months ago
2012
ACM
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
113
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
129
Voted
INFOVIS
2003
IEEE
15 years 7 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...