Sciweavers

993 search results - page 164 / 199
» A Fast Optimization Method for Level Set Segmentation
Sort
View
CGF
2006
191views more  CGF 2006»
15 years 2 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
FAST
2010
15 years 4 months ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
119
Voted
IMC
2003
ACM
15 years 7 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
BMCBI
2007
135views more  BMCBI 2007»
15 years 2 months ago
Sequence similarity is more relevant than species specificity in probabilistic backtranslation
Background: Backtranslation is the process of decoding a sequence of amino acids into the corresponding codons. All synthetic gene design systems include a backtranslation module....
Alfredo Ferro, Rosalba Giugno, Giuseppe Pigola, Al...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 6 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria