500 search results - page 67 / 100 » Approximation algorithms for maximum independent set of pseu... |
115
click to vote
DAC
2010
ACM
15 years 5 months ago
2010
ACM
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
115
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
151
click to vote
JMLR
2008
15 years 1 months ago
2008
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
110
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
110
click to vote
UAI
2008
15 years 3 months ago
2008
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...