4591 search results - page 538 / 919 » The Global Computer |
218
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
170
click to vote
CVBIA
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Important attributes of 3D brain segmentation algorithms include robustness, accuracy, computational efficiency, and facilitation of user interaction, yet few algorithms ...
166
click to vote
IPPS
2003
IEEE
16 years 4 days ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
213
click to vote
EMMCVPR
2003
Springer
16 years 2 days ago
2003
Springer
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
205
click to vote
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide vario...