5210 search results - page 221 / 1042 » Exact geometric computation |
157
click to vote
MOC
2002
15 years 6 months ago
2002
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
145
click to vote
RC
2007
15 years 6 months ago
2007
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
164
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
147
click to vote
ICRA
2005
IEEE
16 years 5 days ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
202
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...