4908 search results - page 642 / 982 » On the Complexity of Optimal K-Anonymity |
183
click to vote
KELSI
2004
Springer
16 years 6 days ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
156
Voted
PATMOS
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. The logical effort method has appeared very convenient for fast estimation and optimization of single paths. However it necessitates a calibration of all the gates of the...
169
click to vote
WAOA
2004
Springer
16 years 5 days ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
183
click to vote
ECCV
2010
Springer
16 years 5 days ago
2010
Springer
Abstract. This paper presents a novel and efficient method for locating deformable shapes in cluttered scenes. The shapes to be detected may undergo arbitrary translational and rot...
117
click to vote
DATE
2003
IEEE
16 years 4 days ago
2003
IEEE
There are already a huge number of problems for silicon designers and it is likely to just get worse. Many of these problems are technical associated with shrinking geometries and...