Sciweavers

1952 search results - page 313 / 391
» Complete partitions of graphs
Sort
View
CSR
2009
Springer
16 years 23 days ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
ICPR
2008
IEEE
16 years 19 days ago
A robust front page detection algorithm for large periodical collections
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...
ICC
2007
IEEE
145views Communications» more  ICC 2007»
16 years 15 days ago
Enhancements to Cognitive Radio Based IEEE 802.22 Air-Interface
—The IEEE 802.22 standard for wireless regional area network is the first standard for cognitive radio that tries to harness the idle or under-utilized spectrum allocated for TV...
Shamik Sengupta, Swastik Brahma, Mainak Chatterjee...
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
16 years 15 days ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
ATAL
2007
Springer
16 years 11 days ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima