Sciweavers

4894 search results - page 925 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
WSCG
2004
190views more  WSCG 2004»
13 years 9 months ago
Scalable Compression and Rendering of Textured Terrain Data
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
Roland Wahl, Manuel Massing, Patrick Degener, Mich...
ATAL
2009
Springer
13 years 8 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
BMCBI
2007
129views more  BMCBI 2007»
13 years 7 months ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl
BMCBI
2008
139views more  BMCBI 2008»
13 years 7 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...