Sciweavers

128 search results - page 19 / 26
» Partitioning a weighted partial order
Sort
View
FLAIRS
2007
13 years 9 months ago
Contextual Concept Discovery Algorithm
In this paper, we focus on the ontological concept extraction and evaluation process from HTML documents. In order to improve this process, we propose an unsupervised hierarchical...
Lobna Karoui, Marie-Aude Aufaure, Nacéra Be...
CIKM
2007
Springer
14 years 1 months ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
CP
2009
Springer
14 years 8 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
SIGMOD
2005
ACM
141views Database» more  SIGMOD 2005»
14 years 7 months ago
Fault-tolerance in the Borealis distributed stream processing system
We present a replication-based approach to fault-tolerant distributed stream processing in the face of node failures, network failures, and network partitions. Our approach aims t...
Magdalena Balazinska, Hari Balakrishnan, Samuel Ma...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 7 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch