3894 search results - page 390 / 779 » Approximation Algorithms for Biclustering Problems |
124
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
Image processing and recognition technologies are becoming increasingly important. Automatic construction methods for image transformation algorithms proposed to date approximate a...
123
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
139
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
156
click to vote
ICANN
2009
Springer
15 years 9 months ago
2009
Springer
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
144
click to vote
COCOON
2001
Springer
15 years 9 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...