Sciweavers

900 search results - page 43 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
162
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 5 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
TKDE
2008
155views more  TKDE 2008»
15 years 3 months ago
Incremental Maintenance of Online Summaries Over Multiple Streams
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
Fatih Altiparmak, Ertem Tuncel, Hakan Ferhatosmano...
116
Voted
ACCV
2009
Springer
15 years 10 months ago
An Online Framework for Learning Novel Concepts over Multiple Cues
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
Luo Jie, Francesco Orabona, Barbara Caputo
FOSSACS
2003
Springer
15 years 8 months ago
When Ambients Cannot Be Opened
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
Iovka Boneva, Jean-Marc Talbot
107
Voted
ICPR
2008
IEEE
15 years 9 months ago
A novel segmentation algorithm for pulmonary nodule in chest radiograph
Segmentation of pulmonary nodules in chest radiographs is a difficult task due to heavy noise and superposition of ribs, vessels, and other anatomical structures in lung field. In...
Erling Wei, Jiayong Yan, Mantao Xu, Jiwu Zhang