Sciweavers

2107 search results - page 46 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
ECCC
2010
98views more  ECCC 2010»
13 years 6 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
ICPP
2008
IEEE
14 years 2 months ago
Machine Learning Models to Predict Performance of Computer System Design Alternatives
Computer manufacturers spend a huge amount of time, resources, and money in designing new systems and newer configurations, and their ability to reduce costs, charge competitive p...
Berkin Özisikyilmaz, Gokhan Memik, Alok N. Ch...
HICSS
2006
IEEE
149views Biometrics» more  HICSS 2006»
14 years 1 months ago
An Efficient Heuristic Search for Real-Time Frequent Pattern Mining
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
Rajanish Dass, Ambuj Mahanti
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
14 years 1 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...