350 search results - page 51 / 70 » Lower bounds and heuristic algorithms for the k |
108
click to vote
CIAC
2010
Springer
15 years 2 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
WG
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
73
Voted
RECOMB
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
SIAMCOMP
2002
14 years 9 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...