689 search results - page 103 / 138 » The multithreaded version of FORM |
138
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
172
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
141
Voted
FC
1998
Springer
15 years 8 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
164
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
139
click to vote
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
A test case consists of two parts: a test input to exercise the program under test and a test oracle to check the correctness of the test execution. A test oracle is often in the f...