Sciweavers

848 search results - page 58 / 170
» Randomness and the linear degrees of computability
Sort
View
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
JSC
2010
155views more  JSC 2010»
14 years 10 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
ECCV
2000
Springer
16 years 1 months ago
Model Based Pose Estimator Using Linear-Programming
Given a ? object and some measurements for points in this object, it is desired to find the ? location of the object. A new model based pose estimator from stereo pairs based on l...
Moshe Ben-Ezra, Shmuel Peleg, Michael Werman
IJON
2007
120views more  IJON 2007»
14 years 11 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
MLDM
2009
Springer
15 years 6 months ago
Dynamic Score Combination: A Supervised and Unsupervised Score Combination Method
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
Roberto Tronci, Giorgio Giacinto, Fabio Roli