Sciweavers

164 search results - page 16 / 33
» The Kolmogorov complexity of random reals
Sort
View
IBPRIA
2007
Springer
15 years 3 months ago
Optimally Discriminant Moments for Speckle Detection in Real B-Scan Images
Detection of speckle in ultrasound (US) images has been regarded as an important research topic in US imaging, mainly focusing on two specific applications: improving signal to no...
Robert Marti, Joan Martí, Jordi Freixenet, ...
APAL
2010
125views more  APAL 2010»
14 years 9 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
IEEEPACT
1997
IEEE
15 years 1 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
PCI
2005
Springer
15 years 3 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
UAI
2008
14 years 11 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
John Duchi, Stephen Gould, Daphne Koller