Sciweavers

1395 search results - page 58 / 279

» (k, )-Distance-Hereditary Graphs

57

PAKDD
1999
ACM

99views Data Mining» more PAKDD 1999»

Efficient Graph-Based Algorithm for Discovering and Maintaining Knowledge in Large Databases

15 years 2 months ago

Efficient Graph-Based Algorithm for Discovering and Maintaining Knowledge in Large Databases

Download www.csie.ndhu.edu.tw

K. L. Lee, Guanling Lee, Arbee L. P. Chen

claim paper

Read More »

55

DAC
1996
ACM

61views Computer Architecture» more DAC 1996»

Lower Bounds on Test Resources for Scheduled Data Flow Graphs

15 years 1 months ago

Lower Bounds on Test Resources for Scheduled Data Flow Graphs

Download poisson.usc.edu

Ishwar Parulkar, Sandeep K. Gupta, Melvin A. Breue...

claim paper

Read More »

68

COMPGEOM
1993
ACM

111views Discrete Geometry» more COMPGEOM 1993»

Can Visibility Graphs be Represented Compactly?

15 years 1 months ago

Can Visibility Graphs be Represented Compactly?

Download www.math.tau.ac.il

Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhas...

claim paper

Read More »

53

PDPTA
2000

84views Distributed And Parallel Com...» more PDPTA 2000»

Coarse Grained Parallel Graph Planarity Testing

14 years 11 months ago

Coarse Grained Parallel Graph Planarity Testing

Download faculty.uncfsu.edu

Edson Cáceres, Albert Chan, Frank K. H. A. ...

claim paper

Read More »

82

ICASSP
2010
IEEE

126views Signal Processing» more ICASSP 2010»

Optimized intrinsic dimension estimator using nearest neighbor graphs

14 years 10 months ago

Optimized intrinsic dimension estimator using nearest neighbor graphs

Download www.eecs.umich.edu

We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...

Kumar Sricharan, Raviv Raich, Alfred O. Hero III

claim paper

Read More »

« Prev « First page 58 / 279 Last » Next »