Sciweavers

2512 search results - page 359 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
SMC
2010
IEEE
139views Control Systems» more  SMC 2010»
14 years 8 months ago
Pin-pointing concept descriptions
In this study, the task of obtaining accurate and comprehensible concept descriptions of a specific set of production instances has been investigated. The suggested method, inspire...
Cecilia Sönströd, Ulf Johansson, Henrik ...
EUROMICRO
1998
IEEE
15 years 2 months ago
The World Wide Wait: Where Does the Time Go?
The continuing explosive growth of the web has not been matched by an adequate enhancement of the infrastructure on which it depends. Both consumers and producers are often left f...
Colin Allison, Martin Bramley, Jose Serrano
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
15 years 4 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
15 years 2 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
DASFAA
1999
IEEE
84views Database» more  DASFAA 1999»
15 years 2 months ago
P-Tree: A B-Tree Index for Lists
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set th...
Ke Wang, Beng Chin Ooi, Sam Yuan Sung