Sciweavers

851 search results - page 133 / 171
» Random constructions and density results
Sort
View
CVPR
2005
IEEE
16 years 30 min ago
Digital Tapestry
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov,...
ICML
2009
IEEE
15 years 10 months ago
Multi-view clustering via canonical correlation analysis
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
Kamalika Chaudhuri, Sham M. Kakade, Karen Livescu,...
INFOCOM
2009
IEEE
15 years 4 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
15 years 4 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
CSFW
2007
IEEE
15 years 4 months ago
Probability of Error in Information-Hiding Protocols
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...