Sciweavers

2492 search results - page 204 / 499
» On the General Signature Trees
Sort
View
EDBT
2011
ACM
205views Database» more  EDBT 2011»
14 years 10 months ago
A probabilistic XML merging tool
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
Talel Abdessalem, M. Lamine Ba, Pierre Senellart
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
SAINT
2005
IEEE
16 years 5 days ago
Learning Logic Wrappers for Information Extraction from the Web
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The...
Costin Badica, Elvira Popescu, Amelia Badica
CIKM
2006
Springer
15 years 10 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
15 years 8 months ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell