Sciweavers

1857 search results - page 39 / 372
» Minimum Degree Orderings
Sort
View
IAT
2008
IEEE
14 years 5 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
CSCW
2008
ACM
14 years 16 days ago
Minimum movement matters: impact of robot-mounted cameras on social telepresence
Recently, various robots capable of having a video chat with distant people have become commercially available. This paper shows that movement of these robots enhances distant peo...
Hideyuki Nakanishi, Yuki Murakami, Daisuke Nogami,...
DAM
2007
153views more  DAM 2007»
13 years 10 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
INFOCOM
2003
IEEE
14 years 4 months ago
Design and Analysis of an MST-Based Topology Control Algorithm
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
Ning Li, Jennifer C. Hou, Lui Sha
COMBINATORICS
2002
93views more  COMBINATORICS 2002»
13 years 10 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka