Sciweavers

2304 search results - page 414 / 461
» On the Vulnerability of Large Graphs
Sort
View
PAISI
2009
Springer
14 years 5 months ago
Discovering Compatible Top-K Theme Patterns from Text Based on Users' Preferences
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
Yongxin Tong, Shilong Ma, Dan Yu, Yuanyuan Zhang, ...
CIKM
2007
Springer
14 years 4 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
MLG
2007
Springer
14 years 4 months ago
Weighted Substructure Mining for Image Analysis
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku K...
STACS
2007
Springer
14 years 4 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
IWCMC
2006
ACM
14 years 4 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras