Sciweavers

1951 search results - page 180 / 391
» An algorithm for improving graph partitions
Sort
View
166
Voted
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
15 years 9 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
BROADNETS
2007
IEEE
16 years 1 months ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
IPPS
2007
IEEE
16 years 1 months ago
Optimization and evaluation of parallel I/O in BIPS3D parallel irregular application
This paper presents the optimization and evaluation of parallel I/O for the BIPS3D parallel irregular application, a 3-dimensional simulation of BJT and HBT bipolar devices. The p...
Rosa Filgueira, David E. Singh, Florin Isaila, Jes...
BMCBI
2010
137views more  BMCBI 2010»
15 years 7 months ago
Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...
MICCAI
2009
Springer
16 years 4 months ago
Multiple Sclerosis Lesion Segmentation Using an Automatic Multimodal Graph Cuts
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
Daniel García-Lorenzo, Jérémy...