Sciweavers

2889 search results - page 70 / 578
» Querying Structured Hyperdocuments
Sort
View
180
Voted
JMLR
2012
13 years 5 months ago
Active Clustering of Biological Sequences
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
JCDCG
2004
Springer
15 years 8 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
SIGMOD
2008
ACM
122views Database» more  SIGMOD 2008»
16 years 2 months ago
Building query optimizers for information extraction: the SQoUT project
Text documents often embed data that is structured in nature. This structured data is increasingly exposed using information extraction systems, which generate structured relation...
Alpa Jain, Panagiotis G. Ipeirotis, Luis Gravano
139
Voted
ER
2005
Springer
136views Database» more  ER 2005»
15 years 8 months ago
A Semantic Approach to Query Rewriting for Integrated XML Data
Query rewriting is a fundamental task in query optimization and data integration. With the advent of the web, there has been renewed interest in data integration, where data is dis...
Xia Yang, Mong-Li Lee, Tok Wang Ling, Gillian Dobb...
140
Voted
DIS
2006
Springer
15 years 6 months ago
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
Taneli Mielikäinen, Pance Panov, Saso Dzerosk...