394 search results - page 74 / 79 » Computing Minimal Polynomials of Matrices |
146
click to vote
TPDS
2008
15 years 2 months ago
2008
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
229
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
123
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
136
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
144
click to vote
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...