7827 search results - page 1461 / 1566 » time 2007 |
157
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
141
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
245
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
The deep Web presents a pressing need for integrating large numbers of dynamically evolving data sources. To be more automatic yet accurate in building an integration system, we o...
240
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
255
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...