Sciweavers

675 search results - page 5 / 135
» Algorithms for estimating relative importance in networks
Sort
View
ALT
2004
Springer
14 years 3 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
IMC
2007
ACM
13 years 8 months ago
A data streaming algorithm for estimating entropies of od flows
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
Haiquan (Chuck) Zhao, Ashwin Lall, Mitsunori Ogiha...
ADHOCNOW
2008
Springer
14 years 1 months ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...
ISRR
2005
Springer
178views Robotics» more  ISRR 2005»
14 years 14 days ago
Improved Estimation of Target Velocity Using Multiple Model Estimation and a Dynamic Bayesian Network for a Robotic Tracker of O
A vision-based automatic tracking system for ocean animals in the midwater has been demonstrated in Monterey Bay, CA. Currently, the input to this system is a measurement of relati...
Aaron Plotnik, Stephen Rock
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen