3894 search results - page 389 / 779 » Approximation Algorithms for Biclustering Problems |
144
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
155
click to vote
HIPC
2004
Springer
15 years 10 months ago
2004
Springer
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip ...
175
Voted
IJON
2006
15 years 5 months ago
2006
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
159
Voted
ICTAI
2010
IEEE
15 years 2 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
132
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper describes a novel algorithm for the efficient synthesis of high-quality virtual views from only two input images. The emphasis is on the recovery of continuity of objec...