Sciweavers

4541 search results - page 615 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ISPD
2005
ACM
140views Hardware» more  ISPD 2005»
16 years 23 days ago
Are floorplan representations important in digital design?
Research in floorplanning and block-packing has generated a variety of data structures to represent spatial configurations of circuit modules. Much of this work focuses on the g...
Hayward H. Chan, Saurabh N. Adya, Igor L. Markov
SIGIR
2004
ACM
16 years 19 days ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
DAWAK
2001
Springer
15 years 11 months ago
Determining the Convex Hull in Large Multidimensional Databases
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
Christian Böhm, Hans-Peter Kriegel
SCCC
2000
IEEE
15 years 11 months ago
A Genetic Classifier Tool
Knowledge discovery is the most desirable end product of an enterprise information system. Researches from different areas recognize that a new generation of intelligent tools for...
Aurora T. R. Pozo, Mozart Hasse
DAC
1997
ACM
15 years 11 months ago
System Level Fixed-Point Design Based on an Interpolative Approach
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
Markus Willems, Volker Bürsgens, Holger Kedin...