Sciweavers

1418 search results - page 194 / 284
» Schema polynomials and applications
Sort
View
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 8 months ago
Monitoring Atomicity in Concurrent Programs
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...
Azadeh Farzan, P. Madhusudan
ESA
2008
Springer
129views Algorithms» more  ESA 2008»
15 years 8 months ago
More Robust Hashing: Cuckoo Hashing with a Stash
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
COLOGNETWENTE
2007
15 years 7 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
CATS
2006
15 years 7 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
DLOG
2001
15 years 7 months ago
TBoxes do not Yield a Compact Representation of Least Common Subsumers
For Description Logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the input descripti...
Franz Baader, Anni-Yasmin Turhan