Sciweavers

5215 search results - page 742 / 1043
» Quantum clustering algorithms
Sort
View
IV
2009
IEEE
128views Visualization» more  IV 2009»
16 years 1 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
BPM
2009
Springer
168views Business» more  BPM 2009»
16 years 1 months ago
Divide-and-Conquer Strategies for Process Mining
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
ICPR
2008
IEEE
16 years 1 months ago
Automatic extraction of natural fracture traces from borehole images
Natural fractures may greatly affect wellbore stability and fluid flow in oil reservoirs. The detection of fracture heterogeneities—also named fracture traces—on electrical im...
Josselin Kherroubi
IROS
2008
IEEE
144views Robotics» more  IROS 2008»
16 years 1 months ago
Frame rate object extraction from video sequences with self organizing networks and statistical background detection
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
Thiago C. Bellardi, Dizan Vasquez, Christian Laugi...
ICCV
2007
IEEE
16 years 1 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers