Sciweavers

203 search results - page 36 / 41
» Improved undecidability results on weighted timed automata
Sort
View
LATIN
2010
Springer
14 years 3 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 9 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
RT
2005
Springer
14 years 1 months ago
Adaptive Frameless Rendering
We propose an adaptive form of frameless rendering with the potential to dramatically increase rendering speed over conventional interactive rendering approaches. Without the rigi...
Abhinav Dayal, Cliff Woolley, Benjamin Watson, Dav...
APGV
2004
ACM
124views Visualization» more  APGV 2004»
14 years 5 days ago
An experimental approach to predicting saliency for simplified polygonal models
In this paper, we consider the problem of determining feature saliency for 3D objects and describe a series of experiments that examined if salient features exist and can be predi...
Sarah Howlett, John Hamill, Carol O'Sullivan