1092 search results - page 186 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
124
Voted
SBBD
2004
15 years 3 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
112
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
108
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
147
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
167
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...