Sciweavers

282 search results - page 23 / 57
» Efficient bundle sorting
Sort
View
SAC
2005
ACM
14 years 28 days ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
13 years 11 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
VLDB
1998
ACM
105views Database» more  VLDB 1998»
13 years 11 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
ICIP
2006
IEEE
14 years 9 months ago
New Results on Efficient Optimal Multilevel Image Thresholding
Image thresholding is one of the most common image processing operations, since almost all image processing schemes need some sort of separation of the pixels into different class...
Martin Luessi, Marco Eichmann, Guido M. Schuster, ...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 8 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...