Sciweavers

17760 search results - page 113 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
CGF
2006
72views more  CGF 2006»
15 years 1 months ago
GEncode: Geometry-driven compression for General Meshes
Performances of actual mesh compression algorithms vary significantly depending on the type of model it encodes. These methods rely on prior assumptions on the mesh to be efficient...
Thomas Lewiner, Marcos Craizer, Hélio Lopes...
TAAS
2008
70views more  TAAS 2008»
15 years 1 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
TALG
2008
86views more  TALG 2008»
15 years 1 months ago
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
Shuchi Chawla, Anupam Gupta, Harald Räcke
ICRA
2010
IEEE
220views Robotics» more  ICRA 2010»
14 years 11 months ago
General object tracking with a component-based target descriptor
In this paper, we present a component-based visual object tracker for mobile platforms. The core of the technique is a component-based descriptor that captures the structure and ap...
Simone Frintrop
ICASSP
2011
IEEE
14 years 5 months ago
Generalized interior-point method for constrained peak power minimization of OFDM signals
In this paper we present two results on reducing the peak power of orthogonal frequency division multiplexing (OFDM) symbols via constellation extension (CE). The first result is...
Zhenhua Yu, Robert J. Baxley, G. Tong Zhou