244 search results - page 43 / 49 » Intervalizing k-Colored Graphs |
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
ISBI
2006
IEEE
15 years 3 months ago
2006
IEEE
Automated detection of stable fracture points in a sequence of Computed Tomography (CT) images is found to be a challenging task. In this paper, an innovative scheme for automatic...
113
click to vote
ISPDC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
MICAI
2005
Springer
15 years 2 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
68
Voted
CPM
1999
Springer
15 years 1 months ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...