Sciweavers

1221 search results - page 111 / 245
» Balanced graph partitioning
Sort
View
ALMOB
2006
89views more  ALMOB 2006»
13 years 10 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
14 years 2 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
EUROPAR
2003
Springer
14 years 3 months ago
On the Characterization of Distributed Virtual Environment Systems
Abstract. Distributed Virtual Environment systems have experienced a spectacular growth last years. One of the key issues in the design of scalable and costeffective DVE systems is...
Pedro Morillo, Juan M. Orduña, Marcos Fern&...
EUC
2006
Springer
14 years 1 months ago
Dynamic Repartitioning of Real-Time Schedule on a Multicore Processor for Energy Efficiency
Multicore processors promise higher throughput at lower power consumption than single core processors. Thus in the near future they will be widely used in hard real-time systems as...
Euiseong Seo, Yongbon Koo, Joonwon Lee