Sciweavers

372 search results - page 15 / 75
» On Finding Small 2-Generating Sets
Sort
View
105
Voted
ECCV
2004
Springer
15 years 11 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
ETS
2002
IEEE
99views Hardware» more  ETS 2002»
14 years 9 months ago
Online Learning Technology in an SME Work-Based Setting
Over the last 20 years there has been increasing interest in work-based learning in the UK business sector as a means to improve and increase the skills of the UK workforce. The m...
Bernd Brink, John Munro, Mike Osborne
CORR
2008
Springer
80views Education» more  CORR 2008»
14 years 9 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer
MP
2008
99views more  MP 2008»
14 years 9 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
TSP
2008
151views more  TSP 2008»
14 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar