Sciweavers

2310 search results - page 399 / 462
» Coloring Random Graphs
Sort
View
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...
CSCLP
2007
Springer
14 years 2 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek
IDEAL
2007
Springer
14 years 2 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 1 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
WIOPT
2006
IEEE
14 years 1 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi