1201 search results - page 89 / 241 » Linear Probing and Graphs |
108
click to vote
ENTCS
2007
15 years 1 months ago
2007
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...
143
click to vote
IJON
2010
14 years 11 months ago
2010
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
116
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
128
click to vote
COMGEO
2006
ACM
15 years 1 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
102
click to vote
ALGORITHMICA
2010
15 years 23 days ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...