Sciweavers

289 search results - page 9 / 58
» On exploiting the power of time in data mining
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 7 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ICPADS
2005
IEEE
14 years 1 months ago
Exploiting Multi-level Parallelism for Homology Search using General Purpose Processors
New biological experimental techniques are continuing to generate large amounts of data using DNA, RNA, human genome and protein sequences. The quantity and quality of data from t...
Xiandong Meng, Vipin Chaudhary
ISLPED
1997
ACM
99views Hardware» more  ISLPED 1997»
13 years 11 months ago
Low power data processing by elimination of redundant computations
We suggest a new technique to reduce energy consumption in the processor datapath without sacrificing performance by exploiting operand value locality at run time. Data locality is...
Mir Azam, Paul D. Franzon, Wentai Liu
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 27 days ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
14 years 29 days ago
Clustering time series from ARMA models with clipped data
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
Anthony J. Bagnall, Gareth J. Janacek