Sciweavers

757 search results - page 106 / 152
» On the hardness of approximating Max-Satisfy
Sort
View
COMPGEOM
2008
ACM
14 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CODES
1998
IEEE
15 years 2 months ago
Software timing analysis using HW/SW cosimulation and instruction set simulator
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
Jie Liu, Marcello Lajolo, Alberto L. Sangiovanni-V...
ICVGIP
2004
14 years 11 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
WSCG
2004
189views more  WSCG 2004»
14 years 11 months ago
Hardware Accelerated Soft Shadows using Penumbra Quads
Shadow mapping is a commonly used technique for generating hard shadows in real time. However, existing shadow map based algorithms cannot render full soft shadows penumbras onto ...
Jukka Arvo, Jan Westerholm
CG
2006
Springer
14 years 9 months ago
Interactive mesh deformation using equality-constrained least squares
Mesh deformation techniques that preserve the differential properties have been intensively studied. In this paper, we propose an equality-constrained least squares approach for s...
H. Masuda, Y. Yoshioka, Y. Furukawa