Sciweavers

448 search results - page 88 / 90
» A Model for Distributing and Querying a Data Warehouse on a ...
Sort
View
SADM
2010
196views more  SADM 2010»
13 years 16 days ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
GIS
2005
ACM
14 years 6 months ago
Monitoring dynamic spatial fields using responsive geosensor networks
Information about dynamic spatial fields, such as temperature, windspeed, or the concentration of gas pollutant in the air, is important for many environmental applications. At th...
Matt Duckham, Silvia Nittel, Michael F. Worboys
SAC
2005
ACM
13 years 11 months ago
LighTS: a lightweight, customizable tuple space supporting context-aware applications
The tuple space model inspired by Linda has recently been rediscovered by distributed middleware. Moreover, some researchers also applied it in the challenging scenarios involving...
Gian Pietro Picco, Davide Balzarotti, Paolo Costa
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
INFOCOM
2009
IEEE
14 years 13 days ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu