Sciweavers

10997 search results - page 48 / 2200
» On the Structure of Complete Sets
Sort
View
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 4 months ago
Cell Search for Cell-Based OFDM Systems Using Quasi Complete Complementary Codes
Abstract—Establishing a radio link in cell-based mobile communication systems involves searching and synchronizing the downlink known pattern of sequences associated with the bas...
Chao-Yu Chen, Ying-Ju Min, Kuei-Ying Lu, Chi-Chao ...
CVPR
2010
IEEE
14 years 13 days ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
IJRR
2002
87views more  IJRR 2002»
13 years 9 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
CLA
2006
13 years 11 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
DISOPT
2008
81views more  DISOPT 2008»
13 years 10 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...