Sciweavers

15485 search results - page 181 / 3097
» Computing Optimal Subsets
Sort
View
ICDCS
2007
IEEE
16 years 19 days ago
Self-Similar Algorithms for Dynamic Distributed Systems
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
K. Mani Chandy, Michel Charpentier
CORR
2007
Springer
123views Education» more  CORR 2007»
15 years 6 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath
PVLDB
2008
82views more  PVLDB 2008»
15 years 5 months ago
Mining non-redundant high order correlations in binary data
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
Xiang Zhang, Feng Pan, Wei Wang 0010, Andrew B. No...
EOR
2006
89views more  EOR 2006»
15 years 6 months ago
Clique-detection models in computational biochemistry and genomics
Many important problems arising in computational biochemistry and genomics have been formulated in terms of underlying combinatorial optimization models. In particular, a number h...
Sergiy Butenko, Wilbert E. Wilhelm
CP
2005
Springer
15 years 12 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...