Sciweavers

99 search results - page 15 / 20
» Fast query expansion using approximations of relevance model...
Sort
View
CGF
2007
158views more  CGF 2007»
13 years 6 months ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
CIKM
2005
Springer
14 years 7 days ago
Implicit user modeling for personalized search
Information retrieval systems (e.g., web search engines) are critical for overcoming information overload. A major deficiency of existing retrieval systems is that they generally...
Xuehua Shen, Bin Tan, ChengXiang Zhai
PODS
2004
ACM
148views Database» more  PODS 2004»
14 years 6 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
14 years 1 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—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...
Zhuang Wang, Slobodan Vucetic
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 9 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...