1067 search results - page 89 / 214 » Probabilistic regular graphs |
107
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
SIAMDM
2000
15 years 12 days ago
2000
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
218
click to vote
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
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 ...
95
Voted
DAM
2008
15 years 21 days ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
125
Voted
COMGEO
2006
ACM
15 years 20 days 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...