Sciweavers

463 search results - page 31 / 93
» The lattice dimension of a graph
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 8 months ago
Evolving Graph Representation and Visualization
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...
Anurat Chapanond, Mukkai S. Krishnamoorthy, G. M. ...
93
Voted
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
14 years 9 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
ARSCOM
2006
81views more  ARSCOM 2006»
14 years 9 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
ICCV
2009
IEEE
14 years 7 months ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
Peter Carr, Richard Hartley
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb