3780 search results - page 532 / 756 » Algorithms for Game Metrics |
143
click to vote
INTERSPEECH
2010
14 years 10 months ago
2010
Sparse Component Analysis is a relatively young technique that relies upon a representation of signal occupying only a small part of a larger space. Mixtures of sparse components ...
128
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We present a new wideband spectral envelope estimation framework for the artificial bandwidth extension problem. The proposed framework builds temporal clusters of the joint sub-...
122
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
118
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
142
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...