7742 search results - page 66 / 1549 » The Robustness of Level Sets |
91
Voted
ACNS
2009
Springer
15 years 4 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...
157
Voted
WG
2004
Springer
15 years 6 months 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...
141
click to vote
ICIP
2006
IEEE
16 years 2 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...
102
click to vote
ISCAS
1999
IEEE
15 years 5 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...
62
Voted
ENTCS
2008
15 years 21 days ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...