2137 search results - page 328 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
108
click to vote
JAL
1998
15 years 2 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
158
Voted
EVOW
2010
Springer
15 years 1 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...
111
click to vote
DATAMINE
2006
15 years 2 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...
109
click to vote
MM
2006
ACM
15 years 8 months ago
2006
ACM
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
104
click to vote
ICASSP
2009
IEEE
15 years 9 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...