Sciweavers

7123 search results - page 1166 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICALP
2009
Springer
16 years 7 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
16 years 7 months ago
Do we mean the same?: disambiguation of extracted keyword queries for database search
Users often try to accumulate information on a topic of interest from multiple information sources. In this case a user's informational need might be expressed in terms of an...
Elena Demidova, Irina Oelze, Peter Fankhauser
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 6 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
SIGMOD
2008
ACM
103views Database» more  SIGMOD 2008»
16 years 6 months ago
XArch: archiving scientific and reference data
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
Heiko Müller, Ioannis Koltsidas, Peter Bunema...
295
Voted
SIGMOD
2008
ACM
159views Database» more  SIGMOD 2008»
16 years 6 months ago
Bootstrapping pay-as-you-go data integration systems
Data integration systems offer a uniform interface to a set of data sources. Despite recent progress, setting up and maintaining a data integration application still requires sign...
Anish Das Sarma, Xin Dong, Alon Y. Halevy
« Prev « First page 1166 / 1425 Last » Next »