Sciweavers

2434 search results - page 40 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ECCV
2004
Springer
16 years 3 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
SPAA
2005
ACM
15 years 7 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
170
Voted
COLOGNETWENTE
2010
15 years 16 days ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey
ICASSP
2011
IEEE
14 years 5 months ago
Integrated Sidelobe Level of sets of Rotated Legendre Sequences
We here address the problem of constructing sets of sequences with low integrated aperiodic auto- and crosscorrelations when the constraint of antipodal symbols is enforced. Our m...
Salvador Javier Haboba, Riccardo Rovatti, Gianluca...
85
Voted
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
15 years 2 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew