Sciweavers

77 search results - page 15 / 16
» Evaluation of Dependency Parsers on Unbounded Dependencies
Sort
View
87
Voted
MOC
2002
118views more  MOC 2002»
14 years 9 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
BMCBI
2007
124views more  BMCBI 2007»
14 years 9 months ago
BioInfer: a corpus for information extraction in the biomedical domain
Background: Lately, there has been a great interest in the application of information extraction methods to the biomedical domain, in particular, to the extraction of relationship...
Sampo Pyysalo, Filip Ginter, Juho Heimonen, Jari B...
TON
2008
155views more  TON 2008»
14 years 9 months ago
A comparative analysis of server selection in content replication networks
Server selection plays an essential role in content replication networks, such as peer-to-peer (P2P) and content delivery networks (CDNs). In this paper, we perform an analytical i...
Tao Wu, David Starobinski
CSFW
2009
IEEE
15 years 4 months ago
Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities
—As networked systems grow in complexity, they are increasingly vulnerable to denial-of-service (DoS) attacks involving resource exhaustion. A single malicious input of coma can ...
Richard M. Chang, Guofei Jiang, Franjo Ivancic, Sr...
MIDDLEWARE
2007
Springer
15 years 3 months ago
Dynamic multi-process information flow tracking for web application security
Although there is a large body of research on detection and prevention of such memory corruption attacks as buffer overflow, integer overflow, and format string attacks, the web...
Susanta Nanda, Lap-Chung Lam, Tzi-cker Chiueh