Sciweavers

1951 search results - page 168 / 391
» An algorithm for improving graph partitions
Sort
View
BMCBI
2008
116views more  BMCBI 2008»
15 years 5 months ago
Algorithm of OMA for large-scale orthology inference
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
Alexander C. J. Roth, Gaston H. Gonnet, Christophe...
IM
2007
15 years 4 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
COMPGEOM
2009
ACM
15 years 11 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
CRV
2008
IEEE
183views Robotics» more  CRV 2008»
15 years 11 months ago
Robust Real-Time Bi-Layer Video Segmentation Using Infrared Video
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
Qiong Wu, Pierre Boulanger, Walter F. Bischof
ICCAD
1994
IEEE
99views Hardware» more  ICCAD 1994»
15 years 9 months ago
Condition graphs for high-quality behavioral synthesis
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To impro...
Hsiao-Ping Juan, Viraphol Chaiyakul, Daniel D. Gaj...