3894 search results - page 345 / 779 » Approximation Algorithms for Biclustering Problems |
158
Voted
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
160
click to vote
RSS
2007
15 years 7 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
167
click to vote
MP
2006
15 years 6 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
231
click to vote
EUSFLAT
2009
15 years 3 months ago
2009
This paper proposes an optimization strategy which is based on neural networks and genetic algorithms to calculate the optimal values of gas injection rate and oil rate for oil pro...
166
Voted
CIMAGING
2010
15 years 7 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...