3818 search results - page 406 / 764 » Word Problems on Compressed Words |
169
click to vote
CIE
2007
Springer
16 years 26 days ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
159
Voted
SCALESPACE
2007
Springer
16 years 24 days ago
2007
Springer
In this work, we address the problem of segmenting multiple objects, under possible occlusions, in a level set framework. A variational energy that incorporates a piecewise constan...
189
click to vote
APCSAC
2005
IEEE
16 years 10 days ago
2005
IEEE
Abstract. Power-balanced instruction scheduling for Very Long Instruction Word (VLIW) processors is an optimization problem which requires a good instruction-level power model for ...
167
Voted
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
188
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...