2656 search results - page 287 / 532 » Design and analysis of algorithms reconsidered |
191
click to vote
UAI
1996
15 years 8 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
249
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
220
click to vote
SSS
2010
Springer
15 years 5 months ago
2010
Springer
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanti...
176
click to vote
APPROX
2004
Springer
16 years 21 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
199
click to vote
SAMOS
2009
Springer
15 years 12 months ago
2009
Springer
The demands for high quality, real-time performance and multi-format video support in consumer multimedia products are ever increasing. In particular, the future multimedia systems...