990 search results - page 109 / 198 » Sub-Graphs of Complete Graph |
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
ATMOS
2007
13 years 9 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
SIROCCO
2007
13 years 9 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
BMCBI
2004
13 years 7 months ago
2004
Background: A wealth of quality genomic and mRNA/EST sequences in recent years has provided the data required for large-scale genome-wide analysis of alternative splicing. We have...