Sciweavers

77 search results - page 14 / 16
» Improving the Representation of Infinite Trees to Deal with ...
Sort
View
TACAS
2009
Springer
122views Algorithms» more  TACAS 2009»
14 years 2 months ago
Test Input Generation for Programs with Pointers
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
Dries Vanoverberghe, Nikolai Tillmann, Frank Piess...
CG
1998
Springer
13 years 7 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
14 years 1 months ago
Building Detection from Mobile Imagery Using Informative SIFT Descriptors
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...
Gerald Fritz, Christin Seifert, Manish Kumar, Luca...
SPIRE
2005
Springer
14 years 1 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
STACS
1992
Springer
13 years 12 months ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter