Sciweavers

13214 search results - page 2515 / 2643
» Pseudorandomness for network algorithms
Sort
View
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
16 years 4 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...
PERCOM
2007
ACM
16 years 4 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
PERCOM
2007
ACM
16 years 4 months ago
Context Aware Routing of Enterprise User Communications
This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locatio...
Munmun De Choudhury, Hari Sundaram, Ajita John, Do...
PERCOM
2006
ACM
16 years 4 months ago
Context-Aware Resource Management in Multi-Inhabitant Smart Homes: A Nash H-Learning based Approach
A smart home aims at building intelligence automation with a goal to provide its inhabitants with maximum possible comfort, minimize the resource consumption and thus overall cost...
Nirmalya Roy, Abhishek Roy, Sajal K. Das
MOBISYS
2008
ACM
16 years 4 months ago
Sherlock: automatically locating objects for humans
Over the course of a day a human interacts with tens or hundreds of individual objects. Many of these articles are nomadic, relying on human memory to manually index, inventory, o...
Aditya Nemmaluri, Mark D. Corner, Prashant J. Shen...
« Prev « First page 2515 / 2643 Last » Next »