2827 search results - page 10 / 566 » Robustness of PSPACE-complete sets |
ACNS
2009
Springer
13 years 11 months ago
2009
Springer
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustnes...
WG
2004
Springer
14 years 28 days ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper describes an efficient feature selection method that quickly selects a small subset out of a given huge feature set; for building robust object detection systems. In th...
MICCAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper is focused on the use of the level set formalism to segment anatomical structures in 3D images (ultrasound ou magnetic resonance images). A closed 3D surface propagates...
ISCAS
1999
IEEE
13 years 12 months ago
1999
IEEE
A vector enhancement of Said and Pearlman's Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image co...