Sciweavers

1217 search results - page 93 / 244
» On compressing frequent patterns
Sort
View
ICIC
2005
Springer
15 years 9 months ago
Analysis of SCTP Handover by Movement Patterns
Stream Control Transmission Protocol (SCTP) is a new end-to-end transport protocol, which can be used to support the mobility of mobile terminals. This paper describes a framework ...
Dong Phil Kim, Seok Joo Koh, Sang Wook Kim
VISUALIZATION
1999
IEEE
15 years 8 months ago
Efficient Compression of Non-Manifold Polygonal Meshes
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...
André Guéziec, Frank Bossen, Gabriel...
DEXAW
2005
IEEE
96views Database» more  DEXAW 2005»
15 years 9 months ago
Mining Complex Patterns from Protein Surfaces
In the domain of bioinformatics, the role played in the biological process by proteins, that act as transmitters and receivers of information thus ruling the mechanisms that deter...
Lorenzo Baldacci, Matteo Golfarelli
SDM
2012
SIAM
293views Data Mining» more  SDM 2012»
13 years 6 months ago
RP-growth: Top-k Mining of Relevant Patterns with Minimum Support Raising
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...
Yoshitaka Kameya, Taisuke Sato
170
Voted
ICML
2007
IEEE
16 years 4 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda