Sciweavers

2514 search results - page 250 / 503
» On the Computation of Approximations of Database Queries
Sort
View
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 10 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
ICDE
2007
IEEE
146views Database» more  ICDE 2007»
15 years 10 months ago
Index-based Most Similar Trajectory Search
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...
Elias Frentzos, Kostas Gratsias, Yannis Theodoridi...
SAC
2008
ACM
15 years 6 months ago
Selectivity estimation in spatial networks
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
ISB
2002
140views more  ISB 2002»
15 years 6 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...