Sciweavers

3250 search results - page 601 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 8 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
PODS
2005
ACM
124views Database» more  PODS 2005»
14 years 8 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...
PPOPP
2010
ACM
14 years 5 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
ICCAD
2004
IEEE
87views Hardware» more  ICCAD 2004»
14 years 5 months ago
Exploiting level sensitive latches in wire pipelining
Wire pipelining emerges as a new necessity for global wires due to increasing wire delay, shrinking clock period and growing chip size. Existing approaches on wire pipelining are ...
V. Seth, Min Zhao, Jiang Hu
CPAIOR
2009
Springer
14 years 3 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...