Sciweavers

15485 search results - page 463 / 3097
» Computing Optimal Subsets
Sort
View
TCS
2008
15 years 6 months 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
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 6 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
PC
2007
133views Management» more  PC 2007»
15 years 6 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
FOCM
2011
117views more  FOCM 2011»
15 years 1 months ago
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
Folkmar Bornemann
TNN
2011
142views more  TNN 2011»
15 years 1 months ago
Optimum Spatio-Spectral Filtering Network for Brain-Computer Interface
—This paper proposes a feature extraction method for motor imagery brain–computer interface (BCI) using electroencephalogram. We consider the primary neurophysiologic phenomeno...
Haihong Zhang, Zhang Yang Chin, Kai Keng Ang, Cunt...