Sciweavers

1170 search results - page 2 / 234
» How Fast Is Too Fast
Sort
View
IWMM
2000
Springer
144views Hardware» more  IWMM 2000»
13 years 9 months ago
Memory Allocation with Lazy Fits
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
Yoo C. Chung, Soo-Mook Moon
CVPR
2000
IEEE
14 years 7 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
MASCOTS
2003
13 years 7 months ago
Large-Scale Network Simulation: How Big? How Fast?
Richard M. Fujimoto, Kalyan S. Perumalla, Alfred P...
JMLR
2006
124views more  JMLR 2006»
13 years 5 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ICML
2006
IEEE
14 years 6 months ago
Fast time series classification using numerosity reduction
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
Xiaopeng Xi, Eamonn J. Keogh, Christian R. Shelton...