Sciweavers

296 search results - page 59 / 60
» Bipartite Graphs as Models of Complex Networks
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 9 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
AAAI
2011
12 years 8 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
3DGIS
2006
Springer
14 years 2 months ago
3D Navigation for 3D-GIS - Initial Requirements
The needs for three-dimensional (3D) visualization and navigation within 3D-GIS environment are growing and expanding rapidly in a variety of fields. In a steady shift from tradit...
Ivin Amri Musliman, Alias Abdul-Rahman, Volker Coo...
ALMOB
2006
138views more  ALMOB 2006»
13 years 8 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh