6549 search results - page 1136 / 1310 » Parsimonious additive models |
153
Voted
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
269
Voted
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
As business intelligence becomes increasingly essential for organizations and as it evolves from strategic to operational, the complexity of Extract-Transform-Load (ETL) processes...
259
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
189
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
170
Voted
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...