Sciweavers

2168 search results - page 184 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ECCV
2004
Springer
16 years 5 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
131
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
199
Voted
TCS
2008
15 years 3 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
104
Voted
ENC
2003
IEEE
15 years 9 months ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
163
Voted
TNN
2008
97views more  TNN 2008»
15 years 3 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
Liefeng Bo, Ling Wang, Licheng Jiao