Sciweavers

303 search results - page 51 / 61
» Update Algorithms for the Sketch Data Model
Sort
View
84
Voted
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 4 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
13 years 7 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
DEXAW
2004
IEEE
123views Database» more  DEXAW 2004»
15 years 3 months ago
Self-Adaptive and Self-Optimising Resource Monitoring for Dynamic Grid Environments
As the number of resources on the Grid tends to be very dynamic and potentially large, it becomes increasingly important to discover and monitor them efficiently. This paper conce...
Helene N. Lim Choi Keung, Justin R. D. Dyson, Step...
126
Voted
MICCAI
2008
Springer
15 years 5 months ago
Soft Tissue Tracking for Minimally Invasive Surgery: Learning Local Deformation Online
Accurate estimation and tracking of dynamic tissue deformation is important to motion compensation, intra-operative surgical guidance and navigation in minimally invasive surgery. ...
Peter Mountney and Guang-Zhong Yang
179
Voted
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 6 days ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti