Sciweavers

736 search results - page 22 / 148
» Distinguishing geometric graphs
Sort
View
JCT
2007
103views more  JCT 2007»
13 years 8 months ago
Geometric drawings of Kn with few crossings
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
Bernardo M. Ábrego, Silvia Fernández...
ICIP
2005
IEEE
14 years 10 months ago
Nonsubsampled contourlet transform: construction and application in enhancement
We present the nonsubsampled contourlet transform and its application in image enhancement. The nonsubsampled contourlet transform is built upon nonsubsampled pyramids and nonsubs...
Jianping Zhou, Arthur L. da Cunha, Minh N. Do
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 8 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
ICDM
2008
IEEE
127views Data Mining» more  ICDM 2008»
14 years 2 months ago
Frequent Subgraph Retrieval in Geometric Graph Databases
Sebastian Nowozin, Koji Tsuda