Sciweavers

1485 search results - page 261 / 297
» connection 2010
Sort
View
MST
2010
101views more  MST 2010»
13 years 6 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
14 years 7 months ago
Propagating Updates Through XML Views Using Lineage Tracing
We address the problem of updating XML views over relational data by translating view updates expressed in the XQuery update facility to embedded SQL updates. Although our XML view...
Leonidas Fegaras
WSDM
2010
ACM
214views Data Mining» more  WSDM 2010»
14 years 5 months ago
You are who you know: Inferring user profiles in Online Social Networks
Online social networks are now a popular way for users to connect, express themselves, and share content. Users in today's online social networks often post a profile, consis...
Alan Mislove, Bimal Viswanath, P. Krishna Gummadi,...
POPL
2010
ACM
14 years 5 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman