1632 search results - page 137 / 327 » Sublinear Time Algorithms for Metric Space Problems |
146
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
133
click to vote
CGF
1998
15 years 3 months ago
1998
We introduce a new approach to three important problems in ray tracing: antialiasing, distributed light sources, and fuzzy reflections of lights and other surfaces. For antialias...
135
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper extends the notion of residuals for fault detection, well known in the continuous system to the timed discrete events systems. The aim is to design the fault indicat...
121
Voted
AAAI
2008
15 years 6 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
111
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...