Sciweavers

4860 search results - page 322 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
84
Voted
TON
2002
82views more  TON 2002»
15 years 13 days ago
On multicast flow control for heterogeneous receivers
In this paper, we study the impact of heterogeneous receivers on the throughput of multicast flow control and propose a new multicast flow control algorithm to optimally partition ...
Rung-Hung Gau, Zygmunt J. Haas, Bhaskar Krishnamac...
122
Voted
TCS
2008
15 years 22 days ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
93
Voted
CORR
2007
Springer
89views Education» more  CORR 2007»
15 years 24 days ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
122
Voted
TALG
2010
158views more  TALG 2010»
14 years 7 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
124
Voted
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
15 years 6 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka