2424 search results - page 170 / 485 » A general algorithm for data dependence analysis |
153
Voted
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
129
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
153
Voted
MHCI
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a framework for the pervasive sharing of data using wireless networks. ‘FarCry’ uses the mobility of users to carry files between separated networks. Throu...
179
Voted
KDD
2003
ACM
16 years 4 months ago
2003
ACM
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
162
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...