Sciweavers

38 search results - page 3 / 8
» Multiple Kronecker covering graphs
Sort
View
IJRR
2008
92views more  IJRR 2008»
13 years 11 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
ASUNAM
2011
IEEE
12 years 11 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
IV
2008
IEEE
158views Visualization» more  IV 2008»
14 years 5 months ago
ComVis: A Coordinated Multiple Views System for Prototyping New Visualization Technology
There is a large number of interactive visualization tools, however no universal tool exists that covers all relevant aspects for all possible application domains. We have develop...
Kresimir Matkovic, Wolfgang Freiler, Denis Gracani...
CSDA
2007
115views more  CSDA 2007»
13 years 11 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
CSCLP
2007
Springer
14 years 5 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...