Sciweavers

150 search results - page 24 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
CGF
2007
98views more  CGF 2007»
13 years 8 months ago
Distance-Ranked Connectivity Compression of Triangle Meshes
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
Patrick Marais, James E. Gain, D. Shreiner
IJCV
2007
135views more  IJCV 2007»
13 years 8 months ago
Application of the Fisher-Rao Metric to Ellipse Detection
The parameter space for the ellipses in a two dimensional image is a five dimensional manifold, where each point of the manifold corresponds to an ellipse in the image. The parame...
Stephen J. Maybank
CAV
2000
Springer
187views Hardware» more  CAV 2000»
14 years 7 days ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
PDCN
2004
13 years 10 months ago
Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless lans
IEEE 802.11, the standard of wireless local area networks (WLANs), allows the coexistence of asynchronous and time-bounded traffic using the distributed coordination function (DCF)...
Joseph Deng, Hsu-Chun Yen
ICPR
2008
IEEE
14 years 3 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang