Sciweavers

4865 search results - page 335 / 973
» The Complexity of Graph Connectivity
Sort
View
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
16 years 1 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
ESANN
2007
15 years 8 months ago
Order in Complex Systems of Nonlinear Oscillators: Phase Locked Subspaces
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
Jan-Hendrik Schleimer, Ricardo Vigário
MICCAI
2010
Springer
15 years 5 months ago
Construction of Neuroanatomical Shape Complex Atlas from 3D Brain MRI
Abstract. This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of s...
Ting Chen, Anand Rangarajan, Stephan J. Eisenschen...
COCOON
2005
Springer
16 years 8 days ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
GD
2005
Springer
16 years 7 days ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong