Sciweavers

796 search results - page 70 / 160
» The Anonymous Subgraph Problem
Sort
View
133
Voted
ANOR
2004
208views more  ANOR 2004»
15 years 2 months ago
Airline Crew Rostering: Problem Types, Modeling, and Optimization
Airline crew rostering is an important part of airline operations and an interesting problem for the application of operations research. The objective is to assign anonymous crew p...
Niklas Kohl, Stefan E. Karisch
ICPR
2002
IEEE
16 years 3 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
155
Voted
CVPR
2003
IEEE
15 years 8 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
112
Voted
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
15 years 7 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha
101
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Toward signal processing theory for graphs and non-Euclidean data
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wol...