Sciweavers

8499 search results - page 1403 / 1700
» networking 2007
Sort
View
VISUAL
2007
Springer
16 years 25 days ago
A Knowledge Synthesizing Approach for Classification of Visual Information
Abstract. An approach for visual information analysis and classification is presented. It is based on a knowledge synthesizing technique to automatically create a relevance map fro...
Le Dong, Ebroul Izquierdo
VOTEID
2007
Springer
16 years 25 days ago
Threat Analysis of a Practical Voting Scheme with Receipts
Kutylowski et al. have introduced a voter-verifiable electronic voting scheme ”a practical voting scheme with receipts”, which provides each voter with a receipt. The voter ca...
Sébastien Foulle, Steve Schneider, Jacques ...
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
16 years 25 days ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 25 days ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
15 years 10 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
« Prev « First page 1403 / 1700 Last » Next »