Sciweavers

3825 search results - page 307 / 765
» The Language of Time: A Reader
Sort
View
EMNLP
2010
15 years 4 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
ICALP
2011
Springer
14 years 10 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx
TON
2012
13 years 9 months ago
Static Routing and Wavelength Assignment for Multicast Advance Reservation in All-Optical Wavelength-Routed WDM Networks
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
Neal Charbonneau, Vinod Vokkarane
KDD
2005
ACM
185views Data Mining» more  KDD 2005»
16 years 7 months ago
Mining comparable bilingual text corpora for cross-language information integration
Integrating information in multiple natural languages is a challenging task that often requires manually created linguistic resources such as a bilingual dictionary or examples of...
Tao Tao, ChengXiang Zhai
ICFP
2008
ACM
16 years 6 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...