3875 search results - page 570 / 775 » Approximation algorithms for the 0-extension problem |
214
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
269
click to vote
JPDC
2007
15 years 6 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
197
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
173
click to vote
CPM
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
160
click to vote
IPL
2007
15 years 6 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...