10988 search results - page 184 / 2198 » Algorithmic Folding Complexity |
91
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
84
Voted
AAAI
2006
15 years 5 months ago
2006
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 ...
114
Voted
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— 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...
101
click to vote
ICDIM
2008
IEEE
15 years 10 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
103
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...