450 search results - page 40 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
126
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
COLING
2010
14 years 6 months ago
2010
In this paper, we consider sentence simplification as a special form of translation with the complex sentence as the source and the simple sentence as the target. We propose a Tre...
113
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
AFRIGRAPH
2004
ACM
15 years 5 months ago
2004
ACM
We present a technique for capturing the extreme dynamic range of natural illumination environments that include the sun and sky, which has presented a challenge for traditional h...
103
click to vote
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...