4009 search results - page 382 / 802 » Clustering on Complex Graphs |
159
click to vote
INFOCOM
2005
IEEE
16 years 13 days ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
178
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
189
Voted
WSC
2000
15 years 8 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
174
click to vote
CAIP
2007
Springer
16 years 1 months ago
2007
Springer
We present a novel method to detect multimodal regions composed of linear structures and measure the orientations in these regions, i.e. at line X-sings, T-junctions and Y-forks. I...
209
click to vote
ICCS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the Coupled Cluster method. Transformations using algeb...