Sciweavers

2232 search results - page 4 / 447
» Has Computational Linguistics Become More Applied
Sort
View
NAACL
2010
13 years 4 months ago
From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
WSC
1998
13 years 7 months ago
Simulation Applied to Theme Park Management
This paper describes the application of computer simulation to a new and interesting problem area, the management of major theme parks. The operation and management of theme parks...
Roland R. Mielke, Adham Zahralddin, Damanjit Padam...
PVM
2001
Springer
13 years 10 months ago
Parallel IO Support for Meta-computing Applications: MPI_Connect IO Applied to PACX-MPI
Parallel IO (PIO) support for larger scale computing is becoming more important as application developers better understand its importance in reducing overall execution time by avo...
Graham E. Fagg, Edgar Gabriel, Michael M. Resch, J...
ACL
2010
13 years 4 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
INFORMATICALT
2008
123views more  INFORMATICALT 2008»
13 years 6 months ago
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities
Abstract. A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part i...
Yaroslav D. Sergeyev