Sciweavers

5606 search results - page 494 / 1122
» Randomization Techniques for Graphs.
Sort
View
216
Voted
ICIP
2009
IEEE
15 years 4 months ago
Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
Luigi Bagnato, Pascal Frossard, Pierre Vandergheyn...
ECCC
2011
205views ECommerce» more  ECCC 2011»
15 years 1 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
ISBI
2011
IEEE
14 years 10 months ago
Segmentation of anatomical branching structures based on texture features and graph cut
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
Tatyana Nuzhnaya, Erkang Cheng, Haibin Ling, Despi...

Lecture Notes
742views
17 years 4 months ago
Computer Systems Analysis
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
Raj Jain
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 8 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...