1773 search results - page 132 / 355 » The Visibility-Voronoi Complex and Its Applications |
145
click to vote
ICECCS
2000
IEEE
15 years 10 months ago
2000
IEEE
The goal of result-verificationis toprove that one execution run of a program satisjes its speciJcation. Compared with iniplenzentation-verification,result-verification has a larg...
144
click to vote
DICTA
2003
15 years 7 months ago
2003
Abstract. Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S3 group, it’s hard to specify meaningful joint cons...
163
click to vote
IPL
2008
15 years 6 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
150
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
154
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...