Sciweavers

1405 search results - page 52 / 281
» Popularity at Minimum Cost
Sort
View
DM
1998
94views more  DM 1998»
14 years 9 months ago
On embedding complete graphs into hypercubes
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
Michael Klugerman, Alexander Russell, Ravi Sundara...
CVPR
2011
IEEE
14 years 4 months ago
Blind Deconvolution Using A Normalized Sparsity Measure
Blind image deconvolution is an ill-posed problem that requires regularization to solve. However, many common forms of image prior used in this setting have a major drawback in th...
Dilip Krishnan, Rob Fergus
70
Voted
TIT
2008
106views more  TIT 2008»
14 years 9 months ago
Constrained Sequential Resource Allocation and Guessing Games
In this paper, we consider a constrained sequential resource allocation problem where an individual needs to accomplish a task by repeatedly guessing/investing a sufficient level o...
Nicholas B. Chang, Mingyan Liu
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 11 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
JMLR
2006
97views more  JMLR 2006»
14 years 9 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke