Sciweavers

18451 search results - page 3679 / 3691
» Selecting a Selection Procedure
Sort
View
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 3 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
PLDI
2012
ACM
11 years 10 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
11 years 10 months ago
Temporal Analytics on Big Data for Web Advertising
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
Badrish Chandramouli, Jonathan Goldstein, Songyun ...
ICDE
2012
IEEE
304views Database» more  ICDE 2012»
11 years 10 months ago
Learning-based Query Performance Modeling and Prediction
— Accurate query performance prediction (QPP) is central to effective resource management, query optimization and query scheduling. Analytical cost models, used in current genera...
Mert Akdere, Ugur Çetintemel, Matteo Rionda...
INFOCOM
2012
IEEE
11 years 10 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
« Prev « First page 3679 / 3691 Last » Next »