Sciweavers

3333 search results - page 579 / 667
» Abstract Proof Search
Sort
View
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 8 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
LCPC
2001
Springer
15 years 8 months ago
Bridging the Gap between Compilation and Synthesis in the DEFACTO System
Abstract. The DEFACTO project - a Design Environment For Adaptive Computing TechnOlogy - is a system that maps computations, expressed in high-level languages such as C, directly o...
Pedro C. Diniz, Mary W. Hall, Joonseok Park, Byoun...
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
15 years 8 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
DAWAK
2000
Springer
15 years 8 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 8 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo