3894 search results - page 405 / 779 » Approximation Algorithms for Biclustering Problems |
156
click to vote
ICCAD
2009
IEEE
15 years 2 months ago
2009
IEEE
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
194
click to vote
TKDE
2012
13 years 7 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
181
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
151
click to vote
JMLR
2006
15 years 4 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
135
click to vote
FUIN
2010
15 years 2 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...