Sciweavers

4218 search results - page 548 / 844
» Complete sets of cooperations
Sort
View
117
Voted
PODS
2008
ACM
178views Database» more  PODS 2008»
16 years 29 days ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
107
Voted
EDBT
2008
ACM
166views Database» more  EDBT 2008»
16 years 29 days ago
OrthoCluster: a new tool for mining synteny blocks and applications in comparative genomics
By comparing genomes among both closely and distally related species, comparative genomics analysis characterizes structures and functions of different genomes in both conserved a...
Xinghuo Zeng, Matthew J. Nesbitt, Jian Pei, Ke Wan...
107
Voted
ICFP
2002
ACM
16 years 23 days ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
153
Voted
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 7 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
COCOON
2009
Springer
15 years 7 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch