Sciweavers

895 search results - page 69 / 179
» Using graphs for some discrete tomography problems
Sort
View
ECEASST
2006
305views more  ECEASST 2006»
13 years 11 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
ICPR
2006
IEEE
15 years 2 days ago
Object Localization Using Input/Output Recursive Neural Networks
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
Lorenzo Sarti, Marco Maggini, Monica Bianchini
COCOA
2009
Springer
14 years 3 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 8 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
FOCS
2007
IEEE
14 years 5 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda