2168 search results - page 354 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
176
Voted
SIGGRAPH
1996
ACM
15 years 7 months ago
1996
ACM
A number of techniques have been proposed for flying through scenes by redisplaying previously rendered or digitized views. Techniques have also been proposed for interpolating be...
146
Voted
CONCURRENCY
1998
15 years 3 months ago
1998
Titanium is a language and system for high-performance parallel scientific computing. Titanium uses Java as its base, thereby leveraging the advantages of that language and allow...
166
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
140
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
162
Voted
KDD
2007
ACM
16 years 4 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...