Sciweavers

1722 search results - page 90 / 345
» Variables in Concept Graphs
Sort
View
CSCLP
2005
Springer
15 years 3 months ago
Partitioning Based Algorithms for Some Colouring Problems
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
Ola Angelsmark, Johan Thapper
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
14 years 12 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
UAI
2008
14 years 11 months ago
Inference for Multiplicative Models
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
Ydo Wexler, Christopher Meek
ECSCW
1997
14 years 11 months ago
Tailoring Cooperation Support through Mediators
: Cooperative processes are strongly influenced by their context. Individual and group experience, work practices, and the organisational setting are variable factors that help sha...
Anja Syri
ISPAN
2002
IEEE
15 years 2 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen