Sciweavers

4670 search results - page 313 / 934
» Testing that distributions are close
Sort
View
3DPVT
2004
IEEE
176views Visualization» more  3DPVT 2004»
15 years 10 months ago
3D Model Retrieval Based on 2D Slice Similarity Measurements
In this paper, we present an approach based on 2D slices for measuring similarity between 3D models. The key idea is to represent the 3D model by a series of slices along certain ...
Jiantao Pu, Yi Liu, Guyu Xin, Hongbin Zha, Weibin ...
172
Voted
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
15 years 8 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
15 years 8 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
UAI
2004
15 years 8 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
Mathias Drton, Thomas S. Richardson
GC
2006
Springer
15 years 6 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei