Sciweavers

1057 search results - page 18 / 212
» Peer-to-Peer utility maximization
Sort
View
ICAC
2005
IEEE
15 years 3 months ago
Model-Driven Placement of Compute Tasks and Data in a Networked Utility
An important problem in resource management for networked resource-sharing systems is the simultaneous allocation of multiple resources to an application. Selfoptimizing systems m...
Piyush Shivam, Adriana Iamnitchi, Aydan R. Yumeref...
INFOCOM
2011
IEEE
14 years 1 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
15 years 3 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...
ECCV
2006
Springer
15 years 11 months ago
Dense Photometric Stereo by Expectation Maximization
Abstract. We formulate a robust method using Expectation Maximization (EM) to address the problem of dense photometric stereo. Previous approaches using Markov Random Fields (MRF) ...
Tai-Pang Wu, Chi-Keung Tang
90
Voted
CDC
2009
IEEE
191views Control Systems» more  CDC 2009»
15 years 2 months ago
Convergence and stability of a distributed CSMA algorithm for maximal network throughput
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...
Libin Jiang, Jean C. Walrand