Sciweavers

770 search results - page 89 / 154
» Toward an Optimal Redundancy Strategy for Distributed Comput...
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
DCC
2004
IEEE
14 years 7 months ago
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
Jing (Tiffany) Li, Zhenyu Tu, Rick S. Blum
ICASSP
2011
IEEE
12 years 11 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
ICPADS
2005
IEEE
14 years 1 months ago
I/O Processor Allocation for Mesh Cluster Computers
As cluster systems become increasingly popular, more and more parallel applications require need not only computing power but also significant I/O performance. However, the I/O s...
Pangfeng Liu, Chun-Chen Hsu, Jan-Jan Wu
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman