Sciweavers

13784 search results - page 2203 / 2757
» On Computing Functions with Uncertainty
Sort
View
PERCOM
2007
ACM
16 years 6 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
MOBISYS
2008
ACM
16 years 6 months ago
Brimon: a sensor network system for railway bridge monitoring
: Railway systems are critical in many regions, and can consist of several tens of thousands of bridges, being used over several decades. It is critical to have a system to monitor...
Kameswari Chebrolu, Bhaskaran Raman, Nilesh Mishra...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 4 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
ALT
2008
Springer
16 years 4 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
16 years 4 months ago
FastRoute: a step to integrate global routing into placement
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
Min Pan, Chris C. N. Chu
« Prev « First page 2203 / 2757 Last » Next »