Sciweavers

1550 search results - page 161 / 310
» Benchmarking for Graph Transformation
Sort
View
111
Voted
BMCBI
2006
199views more  BMCBI 2006»
15 years 27 days ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...
133
Voted
ICCV
2011
IEEE
14 years 26 days ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...
94
Voted
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 6 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
WINET
2010
112views more  WINET 2010»
14 years 11 months ago
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
Stephane Durocher, David G. Kirkpatrick, Lata Nara...
CORR
2010
Springer
342views Education» more  CORR 2010»
14 years 10 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira