3281 search results - page 583 / 657 » Bases for parametrized iterativity |
153
click to vote
INFOCOM
2010
IEEE
15 years 2 days ago
2010
IEEE
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
134
Voted
INFOCOM
2010
IEEE
15 years 2 days ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
112
click to vote
JCO
2010
15 years 1 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
131
click to vote
JMLR
2010
15 years 1 days ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
110
click to vote
PAMI
2010
15 years 20 hour ago
2010
—Although significant efforts have been made in developing nonnegative blind source separation techniques, accurate separation of positive yet dependent sources remains a challen...