Sciweavers

1054 search results - page 13 / 211
» Fast Approximated SIFT
Sort
View
107
Voted
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 13 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
15 years 6 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
80
Voted
CGI
2000
IEEE
15 years 2 months ago
Fast and Stable Animation of Cloth with an Approximated Implicit Method
Realistic animation of soft objects such as cloth is essential for plausible character animation. Many techniques have been proposed for the simulation of soft objects, and most o...
Young-Min Kang, Jeong-Hyeon Choi, Hwan-Gue Cho, Ch...
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Making fast buffer insertion even faster via approximation techniques
Abstract— As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing...
Zhuo Li, Cliff C. N. Sze, Charles J. Alpert, Jiang...