Sciweavers

1999 search results - page 72 / 400
» Dependently Typed Grammars
Sort
View
149
Voted
PAKDD
2009
ACM
135views Data Mining» more  PAKDD 2009»
16 years 28 days ago
On Mining Rating Dependencies in Online Collaborative Rating Networks
The trend of social information processing sees e-commerce and social web applications increasingly relying on user-generated content, such as rating, to determine the quality of o...
Hady Wirawan Lauw, Ee-Peng Lim, Ke Wang
136
Voted
LFP
1994
129views more  LFP 1994»
15 years 7 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
180
Voted
NAACL
2010
15 years 4 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
202
Voted
SIGIR
2012
ACM
13 years 8 months ago
Looking inside the box: context-sensitive translation for cross-language information retrieval
Cross-language information retrieval (CLIR) today is dominated by techniques that use token-to-token mappings from bilingual dictionaries. Yet, state-of-the-art statistical transl...
Ferhan Türe, Jimmy J. Lin, Douglas W. Oard
165
Voted
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 6 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai