Sciweavers

15033 search results - page 404 / 3007
» Complexity Theory and Algorithms
Sort
View
AAAI
2006
15 years 9 months ago
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
Jiang Su, Harry Zhang
ICASSP
2010
IEEE
15 years 7 months ago
Two novel compressed-sensing algorithms for NBI detection in OFDM systems
We propose two novel algorithms based on compressed-sensing theory to estimate and cancel narrow band interference (NBI) in orthogonal frequency division multiplexing (OFDM) syste...
Ahmad Gomaa, K. M. Zahidul Islam, Naofal Al-Dhahir
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ICRA
2008
IEEE
152views Robotics» more  ICRA 2008»
16 years 2 months ago
Stabilization algorithm for a high speed car-like robot achieving steering maneuver
— This paper deals with design and implementation of a stabilization algorithm for a car like robot performing high speed turns. The control of such a kind of system is rather di...
Eric Lucet, Christophe Grand, Damien Sallé,...
DAM
2000
84views more  DAM 2000»
15 years 7 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides