Sciweavers

100 search results - page 18 / 20
» Approximation Algorithms for Geometric Intersection Graphs
Sort
View
ANCS
2005
ACM
14 years 29 days ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...
SGP
2007
13 years 9 months ago
Focal surfaces of discrete geometry
The differential geometry of smooth three-dimensional surfaces can be interpreted from one of two perspectives: in terms of oriented frames located on the surface, or in terms of ...
Jingyi Yu, Xiaotian Yin, Xianfeng Gu, Leonard McMi...
COMPGEOM
2005
ACM
13 years 9 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
ISDA
2009
IEEE
14 years 2 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
KDD
1997
ACM
161views Data Mining» more  KDD 1997»
13 years 11 months ago
Automated Discovery of Active Motifs in Three Dimensional Molecules
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
Xiong Wang, Jason Tsong-Li Wang, Dennis Shasha, Br...