Sciweavers

2294 search results - page 53 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ACCV
2009
Springer
15 years 4 months ago
Skeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
IEEEMSP
2002
IEEE
15 years 2 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
ICML
2007
IEEE
15 years 10 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
TON
2010
196views more  TON 2010»
14 years 4 months ago
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
Shrinivasa Kini, S. Ramasubramanian, Amund Kvalbei...
SPAA
2006
ACM
15 years 3 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...