Sciweavers

2124 search results - page 75 / 425
» Repairing Structurally Complex Data
Sort
View
ICSE
2009
IEEE-ACM
14 years 5 months ago
WISE: Automated test generation for worst-case complexity
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
Jacob Burnim, Sudeep Juvekar, Koushik Sen
WSCG
2004
185views more  WSCG 2004»
13 years 11 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
RECOMB
2006
Springer
14 years 10 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
INFOCOM
2007
IEEE
14 years 4 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
WSCG
2003
185views more  WSCG 2003»
13 years 11 months ago
Complex 3D Feature Registration Using a Marching Template
The registration of 3D form features is essential to the supporting of reverse shape design processes. Extracting an editable shape feature from unordered data points is notorious...
Joris S. M. Vergeest, Sander Spanjaard, Chensheng ...