2489 search results - page 326 / 498 » On the Subgroup Distance Problem |
144
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make them more scalable and robust, but poses s...
165
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
141
click to vote
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 9 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
124
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
138
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...