2519 search results - page 165 / 504 » cost 2007 |
247
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
167
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
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 ...
159
click to vote
HM
2007
Springer
16 years 20 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
188
click to vote
EXPCS
2007
15 years 8 months ago
2007
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...