524 search results - page 44 / 105 » ets 2010 |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
ICDT
2010
ACM
13 years 6 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
COCOON
2010
Springer
14 years 14 days ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
SMA
2010
ACM
13 years 7 months ago
2010
ACM
In a recent paper, Warren, Schaefer, Hirani, and Desbrun proposed a simple method of interpolating a function defined on the boundary of a smooth convex domain, using an integral ...