1477 search results - page 77 / 296 » Random Convex Programs |
NIPS
2007
15 years 3 months ago
2007
It is becoming increasingly important to learn from a partially-observed random matrix and predict its missing elements. We assume that the entire matrix is a single sample drawn ...
118
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
121
Voted
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
123
Voted
JCO
2010
15 years 18 days ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
120
Voted
ICIP
2005
IEEE
16 years 3 months ago
2005
IEEE
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...