Sciweavers

1439 search results - page 120 / 288
» Fast approximation of centrality
Sort
View
118
Voted
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 4 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
15 years 4 months ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
DICTA
2003
15 years 2 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
115
Voted
CGF
2008
124views more  CGF 2008»
15 years 28 days ago
Fast Soft Self-Shadowing on Dynamic Height Fields
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
John Snyder, Derek Nowrouzezahrai
116
Voted
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 27 days ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud