2924 search results - page 213 / 585 » Lower Bounds in Distributed Computing |
118
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
159
Voted
JSSPP
2007
Springer
15 years 9 months ago
2007
Springer
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
126
click to vote
ISHPC
2003
Springer
15 years 8 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
132
click to vote
COMCOM
1998
15 years 3 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
101
Voted
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...