Sciweavers

13603 search results - page 33 / 2721
» On the Complexity of Computing Treelength
Sort
View
WIOPT
2010
IEEE
15 years 2 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
DCG
2011
14 years 11 months ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
NA
2011
373views Computer Vision» more  NA 2011»
14 years 11 months ago
On preconditioned MHSS iteration methods for complex symmetric linear systems
We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, w...
Zhong-Zhi Bai, Michele Benzi, Fang Chen
FCCM
2011
IEEE
251views VLSI» more  FCCM 2011»
14 years 7 months ago
A Scalable Multi-FPGA Platform for Complex Networking Applications
Abstract—Ballooning traffic volumes and increasing linkspeeds require ever high compute power to perform complex real-time processing of network packets. FPGAs have already been...
Sascha Mühlbach, Andreas Koch
175
Voted
ACII
2011
Springer
14 years 4 months ago
3D Corpus of Spontaneous Complex Mental States
Abstract. Hand-over-face gestures, a subset of emotional body language, are overlooked by automatic affect inference systems. We propose the use of hand-over-face gestures as a no...
Marwa Mahmoud, Tadas Baltrusaitis, Peter Robinson,...