Sciweavers

479 search results - page 69 / 96
» General Averaged Divergence Analysis
Sort
View
OOPSLA
2007
Springer
14 years 2 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
PODC
2006
ACM
14 years 2 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
IPSN
2004
Springer
14 years 1 months ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
CONEXT
2005
ACM
13 years 10 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida
NIPS
2003
13 years 9 months ago
AUC Optimization vs. Error Rate Minimization
The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algorithm. However, the objective function optimized in most...
Corinna Cortes, Mehryar Mohri