Sciweavers

3718 search results - page 615 / 744
» On learning with dissimilarity functions
Sort
View
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 6 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
TNN
2010
148views Management» more  TNN 2010»
13 years 2 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
14 years 8 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
CHI
2006
ACM
14 years 8 months ago
A goal-oriented web browser
Many users are familiar with the interesting but limited functionality of Data Detector interfaces like Microsoft's Smart Tags and Google's AutoLink. In this paper we si...
Alexander Faaborg, Henry Lieberman
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith