2356 search results - page 324 / 472 » Characterizations of postman sets |
162
click to vote
CCS
2007
ACM
16 years 19 days ago
2007
ACM
Motivated by a probe-vehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintainin...
150
click to vote
COCO
2007
Springer
16 years 19 days ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
175
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
153
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
A survey of niching algorithms, based on 5 variants of derandomized Evolution Strategies (ES), is introduced. This set of niching algorithms, ranging from the very first derandom...
138
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...