4095 search results - page 276 / 819 » How to test a tree |
109
click to vote
ISCAS
2008
IEEE
15 years 7 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
105
click to vote
3DPVT
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
136
Voted
SMI
2006
IEEE
15 years 6 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
110
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
72
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...