Sciweavers

902 search results - page 41 / 181
» Efficient and Extensible Algorithms for Multi Query Optimiza...
Sort
View
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 6 days ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 8 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
14 years 9 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
SIGSOFT
2003
ACM
14 years 9 months ago
Bogor: an extensible and highly-modular software model checking framework
Model checking is emerging as a popular technology for reasoning about behavioral properties of a wide variety of software artifacts including: requirements models, architectural ...
Robby, Matthew B. Dwyer, John Hatcliff
DATE
2005
IEEE
124views Hardware» more  DATE 2005»
14 years 2 months ago
Multi-Placement Structures for Fast and Optimized Placement in Analog Circuit Synthesis
This paper presents the novel idea of multi-placement structures, for a fast and optimized placement instantiation in analog circuit synthesis. These structures need to be generat...
Raoul F. Badaoui, Ranga Vemuri