Sciweavers

1513 search results - page 154 / 303
» A self-describing data transfer model for ITS applications
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 6 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
GIS
2008
ACM
16 years 7 months ago
Pedestrian flow prediction in extensive road networks using biased observational data
In this paper, we discuss an application of spatial data mining to predict pedestrian flow in extensive road networks using a large biased sample. Existing out-of-the-box techniqu...
Michael May, Simon Scheider, Roberto Rösler, ...
SEMWEB
2004
Springer
15 years 12 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez
SOSP
2009
ACM
16 years 3 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 7 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...