Sciweavers

7519 search results - page 1375 / 1504
» Optimizing Generic Functions
Sort
View
ICFP
2009
ACM
16 years 7 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 6 months ago
Spectral domain-transfer learning
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Qiang Yang, ...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 6 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
16 years 6 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 6 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
« Prev « First page 1375 / 1504 Last » Next »