Sciweavers

315 search results - page 46 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
14 years 9 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
79
Voted
COLT
2010
Springer
14 years 7 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
RTSS
2009
IEEE
15 years 4 months ago
Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
Yan Li, Vivy Suhendra, Yun Liang, Tulika Mitra, Ab...
CAGD
2010
151views more  CAGD 2010»
14 years 9 months ago
On the complexity of smooth spline surfaces from quad meshes
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
Jörg Peters, Jianhua Fan
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
14 years 7 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...