Sciweavers

2342 search results - page 183 / 469
» Sublinear geometric algorithms
Sort
View
COMPGEOM
2006
ACM
16 years 12 days ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
VTS
2006
IEEE
101views Hardware» more  VTS 2006»
16 years 13 days ago
Design Optimization for Robustness to Single Event Upsets
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...
Quming Zhou, Mihir R. Choudhury, Kartik Mohanram
JVCIR
2006
104views more  JVCIR 2006»
15 years 6 months ago
Color image decomposition and restoration
Meyer has recently introduced an image decomposition model to split an image into two components: a geometrical component and a texture (oscillatory) component. Inspired by his wo...
Jean-François Aujol, Sung Ha Kang
CAD
2004
Springer
15 years 6 months ago
Curve fitting and fairing using conic splines
We present an efficient geometric algorithm for conic spline curve fitting and fairing through conic arc scaling. Given a set of planar points, we first construct a tangent contin...
Xunnian Yang
ICC
2009
IEEE
105views Communications» more  ICC 2009»
15 years 4 months ago
Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming
This paper proposes Reflected Simplex codebooks for limited feedback beamforming in multiple-input multipleoutput (MIMO) wireless systems. The codebooks are a geometric constructio...
Daniel J. Ryan, Iain B. Collings, Jean-Marc Valin