Sciweavers

2419 search results - page 119 / 484
» Modeling Spatio-temporal Network Computations: A Summary of ...
Sort
View
SAMOS
2009
Springer
14 years 2 months ago
Realizing FIFO Communication When Mapping Kahn Process Networks onto the Cell
Kahn Process Networks (KPN) are an appealing model of computation to specify streaming applications. When a KPN has to execute on a multi-processor platform, a mapping of the KPN m...
Dmitry Nadezhkin, Sjoerd Meijer, Todor Stefanov, E...
ICANN
2005
Springer
14 years 1 months ago
An Analytic Distance Metric for Gaussian Mixture Models with Application in Image Retrieval
Abstract. In this paper we propose a new distance metric for probability density functions (PDF). The main advantage of this metric is that unlike the popular Kullback-Liebler (KL)...
Giorgos Sfikas, Constantinos Constantinopoulos, Ar...
ICAC
2006
IEEE
14 years 2 months ago
Learning Application Models for Utility Resource Planning
Abstract— Shared computing utilities allocate compute, network, and storage resources to competing applications on demand. An awareness of the demands and behaviors of the hosted...
Piyush Shivam, Shivnath Babu, Jeffrey S. Chase
FOCS
2007
IEEE
14 years 2 months ago
Buy-at-Bulk Network Design with Protection
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce...
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng