Sciweavers

933 search results - page 61 / 187
» Monotone Complexity of a Pair
Sort
View
NAACL
2010
13 years 6 months ago
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
Michael Heilman, Noah A. Smith
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 9 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
ICS
2010
Tsinghua U.
14 years 6 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
ICDCS
2009
IEEE
14 years 6 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ICASSP
2011
IEEE
13 years 16 days ago
Semi-automatic 2D to 3D image conversion using a hybrid Random Walks and graph cuts based approach
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
Raymond Phan, Richard Rzeszutek, Dimitrios Androut...