1700 search results - page 250 / 340 » Combinatorial Pattern Matching |
94
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
123
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
129
click to vote
CGO
2005
IEEE
15 years 6 months ago
2005
IEEE
To minimize the surging power consumption of microprocessors, adaptive computing environments (ACEs) where microarchitectural resources can be dynamically tuned to match a program...
134
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
117
click to vote
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...