Sciweavers

325 search results - page 50 / 65
» Proofs of Restricted Shuffles
Sort
View
AOSD
2008
ACM
15 years 1 months ago
StrongAspectJ: flexible and safe pointcut/advice bindings
AspectJ was designed as a seamless aspect-oriented extension of the Java programming language. However, unlike Java, AspectJ does not have a safe type system: an accepted binding ...
Bruno De Fraine, Mario Südholt, Viviane Jonck...
ER
2008
Springer
110views Database» more  ER 2008»
15 years 1 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 1 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
STRINGOLOGY
2004
15 years 1 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
UAI
2003
15 years 1 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...