3874 search results - page 404 / 775 » Approximation Algorithms for k-hurdle Problems |
209
click to vote
EVOW
2010
Springer
15 years 5 months ago
2010
Springer
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
175
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
172
click to vote
STACS
2007
Springer
16 years 25 days ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
160
Voted
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
156
click to vote
COCOON
2005
Springer
16 years 7 days ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...