Sciweavers

4095 search results - page 605 / 819
» How to test a tree
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 4 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
LREC
2010
180views Education» more  LREC 2010»
13 years 9 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
AAAI
2006
13 years 9 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
CMG
2003
13 years 9 months ago
Men are From Mars, Women Are From Venus, Web Services are From Betelgeuse
Having trouble making robust legacy applications talk to hot new Web applications? Trying to manage business transactions with your partners when everyone is running their proprie...
Denise P. Kalm, Annie W. Shum