Sciweavers

3907 search results - page 391 / 782
» Time, Knowledge, and Choice
Sort
View
GLOBECOM
2008
IEEE
16 years 1 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
16 years 1 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
ICDCS
2007
IEEE
16 years 1 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
ICDS
2007
IEEE
16 years 1 months ago
On Burst Loss in Optical Burst Switched Networks with Hot Potato Deflection Routing
In this article we investigate the effects of increased Control Packet lead Time (CPT) on the loss probability of bursts in an OBS network with deflection routing. In particular w...
Stein Gjessing
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
16 years 28 days ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...