9997 search results - page 404 / 2000 » The case for crowd computing |
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
187
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
238
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
229
Voted
CONIELECOMP
2011
IEEE
14 years 10 months ago
2011
IEEE
This work focuses on developing systems of blocks in SIMULINK and VHDL to reuse on design of applications involving the recognition of polygonal objects. Usage of this work reduce...
268
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...