Sciweavers

1456 search results - page 137 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
USITS
2001
13 years 9 months ago
End-to-End WAN Service Availability
Abstract--This paper seeks to understand how network failures affect the availability of service delivery across wide-area networks (WANs) and to evaluate classes of techniques for...
Bharat Chandra, Michael Dahlin, Lei Gao, Amol Naya...
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
14 years 8 months ago
Unsupervised deduplication using cross-field dependencies
Recent work in deduplication has shown that collective deduplication of different attribute types can improve performance. But although these techniques cluster the attributes col...
Robert Hall, Charles A. Sutton, Andrew McCallum
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 8 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ICAC
2005
IEEE
14 years 1 months ago
Dynamic Black-Box Performance Model Estimation for Self-Tuning Regulators
Methods for automatically managing the performance of computing services must estimate a performance model of that service. This paper explores properties that are necessary for p...
Magnus Karlsson, Michele Covell