6897 search results - page 1101 / 1380 » Parallelization of Modular Algorithms |
223
click to vote
ICANNGA
2007
Springer
16 years 18 days ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
219
click to vote
KDD
2007
ACM
16 years 17 days ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
158
click to vote
RTCSA
2006
IEEE
16 years 13 days ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
180
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
177
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...