Sciweavers

2304 search results - page 398 / 461
» On the Vulnerability of Large Graphs
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 10 months ago
Dichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
Tomás Feder, Pavol Hell, David G. Schell, J...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 10 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
CVIU
2008
188views more  CVIU 2008»
13 years 10 months ago
Learning function-based object classification from 3D imagery
We propose a novel scheme for using supervised learning for function-based classification of objects in 3D images. During the learning process, a generic multi-level hierarchical ...
Michael Pechuk, Octavian Soldea, Ehud Rivlin
AI
2006
Springer
13 years 10 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth