Sciweavers

Share
KAIS
2011
129views more  KAIS 2011»
7 years 11 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
CPC
2011
199views Education» more  CPC 2011»
7 years 11 months ago
Sub-Gaussian Tails for the Number of Triangles in G( n, p)
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
Guy Wolfovitz
PVLDB
2010
112views more  PVLDB 2010»
8 years 2 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
PRESENCE
1998
83views more  PRESENCE 1998»
8 years 4 months ago
Real-Time Continuous Multi-Resolution Method for Models of Arbitrary Topology
Many multiresolution methods have been proposed. Most of them emphasize accuracy and hence are slow. Some methods may be fast, but they may not preserve the geometry of the model....
Rynson W. H. Lau, Mark Green, Danny S. P. To, Jani...
JCISE
2002
204views more  JCISE 2002»
8 years 4 months ago
Hierarchical Iso-Surface Extraction
The extraction and display of iso-surfaces is a standard method for the visualization of volume data sets. In this paper we present a novel approach that utilizes a hierarchy on b...
Ulf Labsik, Kai Hormann, Martin Meister, Günt...
CAGD
2004
76views more  CAGD 2004»
8 years 4 months ago
Mesh quality improvement and other properties in the four-triangles longest-edge partition
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the t...
Angel Plaza, José P. Suárez, Miguel ...
TVCG
2008
110views more  TVCG 2008»
8 years 4 months ago
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
Kaichi Zhou, Eugene Zhang, Jirí Bittner, Pe...
SIAMDM
2008
110views more  SIAMDM 2008»
8 years 4 months ago
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
Rom Pinchasi
COMBINATORICS
2007
78views more  COMBINATORICS 2007»
8 years 4 months ago
Tilings of the sphere with right triangles III: the asymptotically obtuse families
Sommerville and Davies classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. However, if the edge-to-edge restriction is relaxed, there are othe...
Robert J. MacG. Dawson, Blair Doyle
CAGD
2007
77views more  CAGD 2007»
8 years 4 months ago
A geometric diagram and hybrid scheme for triangle subdivision
We introduce a geometrical diagram to study the improvement in shape of triangles generated by iterative application of triangle subdivision. The four Triangles Longest Edge (4TLE...
Angel Plaza, José P. Suárez, Graham ...
books