16404 search results - page 2877 / 3281 » A set coverage problem |
250
click to vote
FGR
2011
IEEE
14 years 10 months ago
2011
IEEE
—Discriminant analysis, especially Fisherface and its numerous variants, have achieved great success in face recognition. However, these methods fail to work for face recognition...
385
click to vote
IBPRIA
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
195
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
255
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
190
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Due to the emergence of Cognitive Radio, a special type of heterogeneous networks attracts increasing interest recently, in which a secondary network composed of cogniti...