Sciweavers

598 search results - page 109 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
VISUALIZATION
2005
IEEE
14 years 9 days ago
Build-by-Number: Rearranging the Real World to Visualize Novel Architectural Spaces
We present Build-by-Number, a technique for quickly designing architectural structures that can be rendered photorealistically at interactive rates. We combine image-based capturi...
Daniel R. Bekins, Daniel G. Aliaga
ASPLOS
2011
ACM
12 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
EPS
1998
Springer
13 years 11 months ago
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
Joachim Sprave, Susanne Rolf
BMCBI
2007
96views more  BMCBI 2007»
13 years 6 months ago
Features generated for computational splice-site prediction correspond to functional elements
Background: Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxil...
Rezarta Islamaj Dogan, Lise Getoor, W. John Wilbur...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 11 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or