Sciweavers

1999 search results - page 40 / 400
» Finding Reductions Automatically
Sort
View
RTS
2010
121views more  RTS 2010»
14 years 8 months ago
A compiler framework for the reduction of worst-case execution times
The current practice to design software for real-time systems is tedious. There is almost no tool support that assists the designer in automatically deriving safe bounds of the wor...
Heiko Falk, Paul Lokuciejewski
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...
ICCV
2007
IEEE
15 years 11 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....
ECCV
2008
Springer
15 years 11 months ago
Learning Spatial Context: Using Stuff to Find Things
The sliding window approach of detecting rigid objects (such as cars) is predicated on the belief that the object can be identified from the appearance in a small region around the...
Geremy Heitz, Daphne Koller
VIS
2009
IEEE
216views Visualization» more  VIS 2009»
15 years 11 months ago
Volume Ray Casting with Peak Finding and Differential Sampling
Direct volume rendering and isosurfacing are ubiquitous rendering techniques in scientific visualization, commonly employed in imaging 3D data from simulation and scan sources. Con...
Aaron Knoll, Younis Hijazi, Rolf Westerteiger, ...