Sciweavers

4039 search results - page 422 / 808
» A Method for Dynamic Clustering of Data
Sort
View
ENDM
2006
77views more  ENDM 2006»
15 years 6 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
16 years 7 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...
COMSWARE
2007
IEEE
16 years 1 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
LCN
2007
IEEE
16 years 1 months ago
Prototyping Service Discovery and Usage in Wireless Sensor Networks
—Heterogeneous Wireless Sensor Networks (WSNs) are envisioned to provide different types of services in an open and dynamic environment. This paper presents the design, implement...
Raluca Marin-Perianu, Hans Scholten, Paul J. M. Ha...
CHI
2004
ACM
16 years 7 months ago
Interactive Comprehensible Data Mining
This paper discusses a novel data mining system devised and developed at Birmingham, which attempts to provide a more effective data mining system. It ties in with the workshop go...
Andy Pryke, Russell Beale