Sciweavers

9604 search results - page 1608 / 1921
» The Duality of TIme and Information
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
WWW
2009
ACM
16 years 7 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
WWW
2008
ACM
16 years 7 months ago
Supporting anonymous location queries in mobile environments with privacygrid
This paper presents PrivacyGrid - a framework for supporting anonymous location-based queries in mobile information delivery systems. The PrivacyGrid framework offers three unique...
Bhuvan Bamba, Ling Liu, Péter Pesti, Ting W...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 7 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
CHI
2008
ACM
16 years 7 months ago
An error model for pointing based on Fitts' law
For decades, Fitts' law (1954) has been used to model pointing time in user interfaces. As with any rapid motor act, faster pointing movements result in increased errors. But...
Jacob O. Wobbrock, Edward Cutrell, Susumu Harada, ...
« Prev « First page 1608 / 1921 Last » Next »