Sciweavers

36 search results - page 4 / 8
» ONE: A Predictable and Scalable DW Model
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
15 years 10 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
JCST
2007
151views more  JCST 2007»
14 years 10 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
15 years 3 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
BMCBI
2010
172views more  BMCBI 2010»
14 years 10 months ago
Comparison of evolutionary algorithms in gene regulatory network model inference
Background: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineeri...
Alina Sîrbu, Heather J. Ruskin, Martin Crane
IPPS
2010
IEEE
14 years 8 months ago
Performance modeling of heterogeneous systems
Predicting how well applications may run on modern systems is becoming increasingly challenging. It is no longer sufficient to look at number of floating point operations and commu...
Jan Christian Meyer, Anne C. Elster