Sciweavers

1314 search results - page 207 / 263
» Approximate data mining in very large relational data
Sort
View
PDPTA
2000
15 years 5 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed
USENIX
2007
15 years 6 months ago
Load Shedding in Network Monitoring Applications
Monitoring and mining real-time network data streams is crucial for managing and operating data networks. The information that network operators desire to extract from the network...
Pere Barlet-Ros, Gianluca Iannaccone, Josep Sanju&...
NAR
2007
135views more  NAR 2007»
15 years 3 months ago
g: Profiler - a web-based toolset for functional profiling of gene lists from large-scale experiments
g:Profiler (http://biit.cs.ut.ee/gprofiler/) is a public web server for characterising and manipulating gene lists resulting from mining high-throughput genomic data. g:Profiler h...
Jüri Reimand, Meelis Kull, Hedi Peterson, Jaa...
SIGMOD
1999
ACM
125views Database» more  SIGMOD 1999»
15 years 8 months ago
Selectivity Estimation in Spatial Databases
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
Swarup Acharya, Viswanath Poosala, Sridhar Ramaswa...
DSMML
2004
Springer
15 years 9 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...