5592 search results - page 750 / 1119 » On Random Betweenness Constraints |
185
click to vote
IPPS
2009
IEEE
16 years 2 months ago
2009
IEEE
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...
190
click to vote
APPROX
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
224
click to vote
WADS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
190
click to vote
WEBI
2009
Springer
16 years 2 months ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
198
click to vote
CIKM
2009
Springer
16 years 2 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...