Sciweavers

1425 search results - page 158 / 285
» Beyond Dependency Graphs
Sort
View
FCS
2009
13 years 6 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 5 months ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux
IROS
2007
IEEE
148views Robotics» more  IROS 2007»
14 years 2 months ago
Tractable probabilistic models for intention recognition based on expert knowledge
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
Oliver C. Schrempf, David Albrecht, Uwe D. Hanebec...
CCS
2007
ACM
14 years 2 months ago
Analyzing the vulnerability of superpeer networks against attack
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...
FASE
2005
Springer
14 years 1 months ago
Kaveri: Delivering the Indus Java Program Slicer to Eclipse
This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it’s Eclipse-based user interface called Kaveri. Indus pro...
Ganeshan Jayaraman, Venkatesh Prasad Ranganath, Jo...