Sciweavers

1648 search results - page 92 / 330
» On the generation of bicliques of a graph
Sort
View
FLAIRS
2006
15 years 7 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
ICMLA
2009
15 years 4 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 6 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
ICRA
2005
IEEE
113views Robotics» more  ICRA 2005»
16 years 1 hour ago
A Sample-based Convex Cover for Rapidly Finding an Object in a 3-D Environment
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
EPEW
2008
Springer
15 years 8 months ago
Assembly Code Analysis Using Stochastic Process Algebra
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
Lamia Djoudi, Leïla Kloul