429 search results - page 50 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
101
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
167
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
COLT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
CAV
2008
Springer
14 years 12 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...