Sciweavers

204 search results - page 26 / 41
» Testing Triangle-Freeness in General Graphs
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
EC
2007
118views ECommerce» more  EC 2007»
14 years 11 months ago
Geometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
BMCBI
2008
149views more  BMCBI 2008»
14 years 12 months ago
All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
Antti Airola, Sampo Pyysalo, Jari Björne, Tap...
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
15 years 25 days ago
Evolutionary synthesis of low-sensitivity equalizers using adjacency matrix representation
An evolutionary synthesis method to design low-sensitivity IIR filters with linear phase in the passband is presented. The method uses a chromosome coding scheme based on the grap...
Leonardo Bruno de Sá, Antonio Carneiro Mesq...
DAC
2005
ACM
16 years 21 days ago
Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration
Many reconfigurable architectures offer partial dynamic configurability, but current system-level tools cannot guarantee feasible implementations when exploiting this feature. We ...
Sudarshan Banerjee, Elaheh Bozorgzadeh, Nikil D. D...