3007 search results - page 448 / 602 » Linear Functional Fixed-points |
118
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
173
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
154
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
136
click to vote
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
144
click to vote
POPL
2010
ACM
16 years 15 days ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...