Sciweavers

1787 search results - page 46 / 358
» Approximation Techniques for Spatial Data
Sort
View
SIGCOMM
2006
ACM
14 years 2 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
GIS
2008
ACM
14 years 10 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, ...
SAINT
2003
IEEE
14 years 2 months ago
Extracting Spatial Knowledge from the Web
The content of the world-wide web is pervaded by information of a geographical or spatial nature, particularly such location information as addresses, postal codes, and telephone ...
Yasuhiko Morimoto, Masaki Aono, Michael E. Houle, ...
DMIN
2008
147views Data Mining» more  DMIN 2008»
13 years 10 months ago
Approximate Computation of Object Distances by Locality-Sensitive Hashing
We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number ...
Selim Mimaroglu, Dan A. Simovici
ENC
2006
IEEE
14 years 14 days ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...