Sciweavers

2304 search results - page 176 / 461
» On the Vulnerability of Large Graphs
Sort
View
COMGEO
2002
ACM
15 years 6 months ago
Beta-skeletons have unbounded dilation
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
David Eppstein
ICML
2002
IEEE
16 years 7 months ago
Diffusion Kernels on Graphs and Other Discrete Input Spaces
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
Risi Imre Kondor, John D. Lafferty
ICB
2007
Springer
163views Biometrics» more  ICB 2007»
16 years 21 days ago
Palmprint Recognition Based on Directional Features and Graph Matching
Palmprint recognition, as a reliable personal identity check method, has been receiving increasing attention during recent years. According to previous work, local texture analysis...
Yufei Han, Tieniu Tan, Zhenan Sun
CIG
2006
IEEE
16 years 18 days ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara
IPPS
2006
IEEE
16 years 17 days ago
Parallel FPGA-based all-pairs shortest-paths in a directed graph
With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. In this paper,...
Uday Bondhugula, Ananth Devulapalli, Joseph Fernan...