1732 search results - page 29 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
161
click to vote
CIS
2004
Springer
15 years 11 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
174
click to vote
EWCBR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This paper presents a case-based approach to decision support for diabetes management in patients with Type 1 diabetes on insulin pump therapy. To avoid serious disease c...
164
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
149
click to vote
CPC
2007
15 years 6 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
124
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
The main contribution of this work is to propose efficient randomized leader election and initialization protocols for Packet Radio Networks (PRN, for short). As a result of the i...