Sciweavers

206 search results - page 14 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
DKE
2006
94views more  DKE 2006»
13 years 7 months ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 1 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
AIPS
2004
13 years 9 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 8 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
DEXA
2008
Springer
85views Database» more  DEXA 2008»
13 years 9 months ago
Reordering of Location Identifiers for Indexing an RFID Tag Object Database
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...
Sungwoo Ahn, Bonghee Hong