Sciweavers

12863 search results - page 926 / 2573
» Dynamic Data Mining
Sort
View
KDD
2004
ACM
213views Data Mining» more  KDD 2004»
16 years 1 months ago
Analytical view of business data
This paper describes a logical extension to Microsoft Business Framework (MBF) called Analytical View (AV). AV consists of three components: Model Service for design time, Busines...
Adam Yeh, Jonathan Tang, Youxuan Jin, Sam Skrivan
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
15 years 5 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
NAR
2011
172views Computer Vision» more  NAR 2011»
14 years 10 months ago
NGSmethDB: a database for next-generation sequencing single-cytosine-resolution DNA methylation data
Next-generation sequencing (NGS) together with bisulphite conversion allows the generation of whole genome methylation maps at single-cytosine resolution. This allows studying the...
Michael Hackenberg, Guillermo Barturen, José...
ISPDC
2006
IEEE
16 years 1 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
JEA
2008
112views more  JEA 2008»
15 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes