Sciweavers

3598 search results - page 153 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
15 years 9 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
STRINGOLOGY
2004
15 years 7 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
CCS
2007
ACM
15 years 10 months ago
Efficient policy analysis for administrative role based access control
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...
CAE
2007
15 years 8 months ago
An Efficient Perception-based Adaptive Color to Gray Transformation
The visualization of color images in gray scale has high practical and theoretical importance. Neither the existing local, gradient based methods, nor the fast global techniques g...
László Neumann, Martin Cadík,...
ACSC
2002
IEEE
15 years 11 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
Krisztián Monostori, Arkady B. Zaslavsky, H...