Sciweavers

656 search results - page 22 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
108
Voted
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 3 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
95
Voted
BMCBI
2010
89views more  BMCBI 2010»
14 years 9 months ago
Semi-automatic identification of punching areas for tissue microarray building: the tubular breast cancer pilot study
Background: Tissue MicroArray technology aims to perform immunohistochemical staining on hundreds of different tissue samples simultaneously. It allows faster analysis, considerab...
Federica Viti, Ivan Merelli, Mieke Timmermans, Mic...
JOC
2011
104views more  JOC 2011»
14 years 15 days ago
On the Security of Oscillator-Based Random Number Generators
Physical random number generators (a.k.a. TRNGs) appear to be critical components of many cryptographic systems. Yet, such building blocks are still too seldom provided with a form...
Mathieu Baudet, David Lubicz, Julien Micolod, Andr...
CORR
2010
Springer
185views Education» more  CORR 2010»
14 years 9 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
14 years 7 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick