724 search results - page 75 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
DAC
2001
ACM
16 years 24 days ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
193
click to vote
ICDE
1997
IEEE
16 years 1 months ago
1997
IEEE
Transaction delegation, as introduced in ACTA, allows a transaction to transfer responsibility for the operations that it has performed on an object to another transaction. Delega...
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
ICML
2007
IEEE
16 years 20 days ago
2007
IEEE
Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including ...
106
click to vote
LFP
1992
15 years 1 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...