Sciweavers

5100 search results - page 346 / 1020
» The Linear Complexity of a Graph
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 6 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
163
Voted
DM
2008
112views more  DM 2008»
15 years 5 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
151
Voted
CVIU
2007
125views more  CVIU 2007»
15 years 5 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...
PAMI
2006
141views more  PAMI 2006»
15 years 5 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
162
Voted
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
15 years 3 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...