Sciweavers

1964 search results - page 147 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 8 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 2 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
CASES
2005
ACM
13 years 10 months ago
Architectural support for real-time task scheduling in SMT processors
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
ICCSA
2009
Springer
14 years 2 months ago
A Performance Comparison of Swarm Intelligence Inspired Routing Algorithms for MANETs
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problems...
Jin Wang, Sungyoung Lee
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 5 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff