Sciweavers

1955 search results - page 380 / 391
» Online Multitask Learning
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
EUROSYS
2006
ACM
14 years 4 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
IUI
2010
ACM
14 years 4 months ago
Personalized news recommendation based on click behavior
Online news reading has become very popular as the web provides access to news articles from millions of sources around the world. A key challenge of news websites is to help user...
Jiahui Liu, Peter Dolan, Elin Rønby Pederse...
FASE
2009
Springer
14 years 2 months ago
SNIFF: A Search Engine for Java Using Free-Form Queries
Reuse of existing libraries simplifies software development efforts. However, these libraries are often complex and reusing the APIs in the libraries involves a steep learning cu...
Shaunak Chatterjee, Sudeep Juvekar, Koushik Sen