Sciweavers

3819 search results - page 188 / 764
» Simple Easy Terms
Sort
View
175
Voted
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
16 years 7 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
242
Voted
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 7 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
271
Voted
VLDB
2007
ACM
159views Database» more  VLDB 2007»
16 years 7 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
ICSE
2008
IEEE-ACM
16 years 7 months ago
Performance modeling for service oriented architectures
We present a tool for performance modeling of Service Oriented Architectures (SOAs). As mission-critical use of whole-ofgovernment SOAs become pervasive, the capability to model a...
Paul Brebner
ICFP
2004
ACM
16 years 7 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch