Sciweavers

1538 search results - page 167 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
15 years 3 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
162
Voted
SAC
2010
ACM
15 years 10 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
IS
2007
15 years 3 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
146
Voted
IV
2007
IEEE
164views Visualization» more  IV 2007»
15 years 10 months ago
Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
Pierre-Yves Koenig, Guy Melançon, Charles B...
ICB
2007
Springer
238views Biometrics» more  ICB 2007»
15 years 7 months ago
Keypoint Identification and Feature-Based 3D Face Recognition
We present a feature-based 3D face recognition algorithm and propose a keypoint identification technique which is repeatable and identifies keypoints where shape variation is high ...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens