4233 search results - page 184 / 847 » Three Paths to Effectiveness |
140
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
159
click to vote
TPHOL
2008
IEEE
15 years 11 months ago
2008
IEEE
We describe a tutorial that demonstrates the use of the ACL2 theorem prover. We have three goals: to enable a motivated reader to start on a path towards effective use of ACL2; to...
149
click to vote
ISCAS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, an efficient VLSI architecture for a fast computation of the 2-D discrete wavelet transform (DWT) is proposed. The architecture employing a three-stage cascade in p...
126
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
132
click to vote
GD
2004
Springer
15 years 10 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...