Sciweavers

3897 search results - page 302 / 780
» complexity 2010
Sort
View
PODC
2010
ACM
15 years 6 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 6 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
DSD
2010
IEEE
110views Hardware» more  DSD 2010»
15 years 6 months ago
A Predictable Multiprocessor Design Flow for Streaming Applications with Dynamic Behaviour
—The design of new embedded systems is getting more and more complex as more functionality is integrated into these systems. To deal with the design complexity, a predictable des...
Sander Stuijk, Marc Geilen, Twan Basten
ICASSP
2010
IEEE
15 years 6 months ago
Empirical Type-i filter design for image interpolation
Empirical filter designs generalize relationships inferred from training data to effect realistic solutions that conform well to the human visual system. Complex algorithms invol...
Karl S. Ni, Truong Q. Nguyen
ICASSP
2010
IEEE
15 years 6 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...