Sciweavers

7103 search results - page 1373 / 1421
» Components and Generative Programming
Sort
View
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 9 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 9 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
SIGMOD
2003
ACM
175views Database» more  SIGMOD 2003»
14 years 9 months ago
WinMagic : Subquery Elimination Using Window Aggregation
Database queries often take the form of correlated SQL queries. Correlation refers to the use of values from the outer query block to compute the inner subquery. This is a conveni...
Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Che...
SIGMOD
2002
ACM
236views Database» more  SIGMOD 2002»
14 years 9 months ago
The Cougar Approach to In-Network Query Processing in Sensor Networks
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...
Yong Yao, Johannes Gehrke
« Prev « First page 1373 / 1421 Last » Next »