Sciweavers

7228 search results - page 305 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
MM
2003
ACM
120views Multimedia» more  MM 2003»
15 years 10 months ago
Linking multimedia presentations with their symbolic source documents: algorithm and applications
An algorithm is presented that automatically matches images of presentation slides to the symbolic source file (e.g., PowerPointTM or AcrobatTM ) from which they were generated. T...
Berna Erol, Jonathan J. Hull, Dar-Shyang Lee
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 9 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
WWW
2007
ACM
16 years 5 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
CIKM
2009
Springer
15 years 11 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
MOBIHOC
2009
ACM
16 years 5 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu