Sciweavers

2570 search results - page 36 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
KDD
1998
ACM
200views Data Mining» more  KDD 1998»
15 years 2 months ago
Fast Computation of 2-Dimensional Depth Contours
"Oneperson's noise is another person's signal." For manyapplications, including the detection of credit card frauds and the monitoringof criminal activities in...
Theodore Johnson, Ivy Kwok, Raymond T. Ng
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 8 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
15 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
14 years 1 months ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier