Sciweavers

9209 search results - page 1422 / 1842
» Data Space Randomization
Sort
View
COCOON
2010
Springer
15 years 11 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
CIKM
2000
Springer
15 years 11 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
EDBT
2000
ACM
15 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
NPIV
1999
ACM
142views Visualization» more  NPIV 1999»
15 years 11 months ago
ALMOST: Exploring Program Traces
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...
Manos Reniers, Steven P. Reis
ISCA
1999
IEEE
110views Hardware» more  ISCA 1999»
15 years 11 months ago
Decoupling Local Variable Accesses in a Wide-Issue Superscalar Processor
Providing adequate data bandwidth is extremely important for a wide-issue superscalar processor to achieve its full performance potential. Adding a large number of ports to a data...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
« Prev « First page 1422 / 1842 Last » Next »