Sciweavers

721 search results - page 74 / 145
» Graphs with Large Obstacle Numbers
Sort
View
EMMCVPR
2007
Springer
14 years 1 months ago
An Automatic Portrait System Based on And-Or Graph Representation
Abstract. In this paper, we present an automatic human portrait system based on the And-Or graph representation. The system can automatically generate a set of life-like portraits ...
Feng Min, Jin-Li Suo, Song Chun Zhu, Nong Sang
ICCS
2009
Springer
14 years 3 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
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...
Nicolas Moreau, Michel Leclère, Madalina Cr...
CN
2010
121views more  CN 2010»
13 years 6 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 10 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou