Sciweavers

478 search results - page 39 / 96
» Context-Sensitive Dependency Pairs
Sort
View
COCOON
2008
Springer
15 years 1 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
LPAR
2010
Springer
14 years 9 months ago
Infinite Families of Finite String Rewriting Systems and Their Confluence
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
Jean-Pierre Jouannaud, Benjamin Monate
JMLR
2011
187views more  JMLR 2011»
14 years 6 months ago
Exploitation of Machine Learning Techniques in Modelling Phrase Movements for Machine Translation
We propose a distance phrase reordering model (DPR) for statistical machine translation (SMT), where the aim is to learn the grammatical rules and context dependent changes using ...
Yizhao Ni, Craig Saunders, Sándor Szedm&aac...
BMCBI
2006
86views more  BMCBI 2006»
14 years 12 months ago
MCALIGN2: Faster, accurate global pairwise alignment of non-coding DNA sequences based on explicit models of indel evolution
Background: Non-coding DNA sequences comprise a very large proportion of the total genomic content of mammals, most other vertebrates, many invertebrates, and most plants. Unravel...
Jun Wang, Peter D. Keightley, Toby Johnson
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
15 years 12 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton