5595 search results - page 897 / 1119 » Approximation Algorithms for Clustering Problems |
174
click to vote
ICA
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
185
click to vote
DKE
2006
15 years 6 months ago
2006
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
252
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
153
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
186
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...