Sciweavers

860 search results - page 28 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
CAINE
2003
13 years 9 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding
PVLDB
2008
201views more  PVLDB 2008»
13 years 7 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
SAC
2009
ACM
14 years 10 days ago
Incremental board: a grid-based space for visualizing dynamic data sets
In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We introduce a chess board analogy for displaying (projecting) obj...
Roberto Pinho, Maria Cristina Ferreira de Oliveira...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 1 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
INFOCOM
2003
IEEE
14 years 28 days ago
Distributed Network Monitoring with Bounded Link Utilization in IP Networks
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
Erran L. Li, Marina Thottan, Bin Yao, Sanjoy Paul