Sciweavers

121 search results - page 13 / 25
» First-Order Queries over One Unary Function
Sort
View
LCPC
2004
Springer
15 years 5 months ago
Supporting SQL-3 Aggregations on Grid-Based Data Repositories
There is an increasing trends towards distributed and shared repositories for storing scientific datasets. Developing applications that retrieve and process data from such reposit...
Li Weng, Gagan Agrawal, Ümit V. Çataly...
WWW
2005
ACM
16 years 12 days ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 11 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...
CIMCA
2008
IEEE
15 years 1 months ago
RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
Amir Jahangard Rafsanjani, Seyed-Hassan Mirian-Hos...
CVPR
2007
IEEE
15 years 6 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...