Sciweavers

118 search results - page 22 / 24
» The Shortest Path Problem Under Partial Monitoring
Sort
View
NIPS
2004
13 years 8 months ago
Incremental Algorithms for Hierarchical Classification
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
Nicolò Cesa-Bianchi, Claudio Gentile, Andre...
IPSN
2004
Springer
14 years 22 days 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
ALGOSENSORS
2007
Springer
14 years 1 months ago
Counting Targets with Mobile Sensors in an Unknown Environment
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
Beat Gfeller, Matús Mihalák, Subhash...
EDBT
2006
ACM
191views Database» more  EDBT 2006»
14 years 7 months ago
Distributed Spatial Clustering in Sensor Networks
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
Anand Meka, Ambuj K. Singh
HOTOS
1993
IEEE
13 years 11 months ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day