Sciweavers

587 search results - page 86 / 118
» Theory of matching pursuit
Sort
View
EDBTW
2010
Springer
14 years 3 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 3 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
LATA
2009
Springer
14 years 3 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
HT
2009
ACM
14 years 3 months ago
On hypertext narrative
Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. I...
Mark Bernstein
RECSYS
2009
ACM
14 years 3 months ago
FriendSensing: recommending friends using mobile phones
We propose FriendSensing, a framework that automatically suggests friends to mobile social-networking users. Using short-range technologies (e.g., Bluetooth) on her mobile phone, ...
Daniele Quercia, Licia Capra