503 search results - page 62 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
124
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
119
click to vote
SIAMSC
2008
15 years 3 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
139
Voted
CORR
2010
Springer
15 years 4 days ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
138
click to vote
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
156
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...