Sciweavers

1326 search results - page 225 / 266
» Approximate Tree Kernels
Sort
View
ACL
2009
14 years 11 months ago
Variational Decoding for Statistical Machine Translation
Statistical models in machine translation exhibit spurious ambiguity. That is, the probability of an output string is split among many distinct derivations (e.g., trees or segment...
Zhifei Li, Jason Eisner, Sanjeev Khudanpur
MOBIHOC
2006
ACM
16 years 1 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
FOCS
2007
IEEE
15 years 8 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 2 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
COMPGEOM
2006
ACM
15 years 8 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...