Sciweavers

3819 search results - page 496 / 764
» Predicting Dependability by Testing
Sort
View
TVCG
2012
187views Hardware» more  TVCG 2012»
13 years 7 months ago
Effective Replays and Summarization of Virtual Experiences
—Direct replays of the experience of a user in a virtual environment are difficult for others to watch due to unnatural camera motions. We present methods for replaying and summ...
Kevin Ponto, Joe Kohlmann, Michael Gleicher
162
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 11 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ISSTA
2009
ACM
15 years 11 months ago
Advanced code coverage analysis using substring holes
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
Yoram Adler, Eitan Farchi, Moshe Klausner, Dan Pel...
141
Voted
BMCBI
2008
99views more  BMCBI 2008»
15 years 5 months ago
Binning sequences using very sparse labels within a metagenome
Background: In metagenomic studies, a process called binning is necessary to assign contigs that belong to multiple species to their respective phylogenetic groups. Most of the cu...
Chon-Kit Kenneth Chan, Arthur L. Hsu, Saman K. Hal...
CPHYSICS
2006
127views more  CPHYSICS 2006»
15 years 5 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris