Sciweavers

2223 search results - page 136 / 445
» Multimedia structuring using trees
Sort
View
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
15 years 6 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
156
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
EVOW
2007
Springer
15 years 7 months ago
Toward Greater Artistic Control for Interactive Evolution of Images and Animation
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
David A. Hart
105
Voted
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 27 days ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
CPAIOR
2005
Springer
15 years 6 months ago
Nondeterministic Control for Hybrid Search
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
Pascal Van Hentenryck, Laurent Michel