Sciweavers

3702 search results - page 198 / 741
» All Pairings Are in a Group
Sort
View
ICPR
2002
IEEE
15 years 11 months ago
A Perceptual Shape Descriptor
The proposed shape descriptor is based on the beams originated from a boundary point, which are defined as lines connecting that point with the rest of the points on the boundary....
Nafiz Arica, Fatos T. Yarman-Vural
SSD
1993
Springer
91views Database» more  SSD 1993»
15 years 10 months ago
Volumes From Overlaying 3-D Triangulations in Parallel
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
Wm. Randolph Franklin, Mohan S. Kankanhalli
VLDB
1989
ACM
97views Database» more  VLDB 1989»
15 years 10 months ago
Finding Regular Simple Paths in Graph Databases
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
Alberto O. Mendelzon, Peter T. Wood
CCS
2006
ACM
15 years 10 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
COCOON
2006
Springer
15 years 8 months ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...