Sciweavers

2735 search results - page 131 / 547
» Comparing notions of randomness
Sort
View
EMNLP
2006
13 years 11 months ago
Multilingual Deep Lexical Acquisition for HPSGs via Supertagging
We propose a conditional random fieldbased method for supertagging, and apply it to the task of learning new lexical items for HPSG-based precision grammars of English and Japanes...
Phil Blunsom, Timothy Baldwin
EOR
2010
145views more  EOR 2010»
13 years 10 months ago
Robust and data-driven approaches to call centers
We propose both robust and data-driven approaches to a fluid model of call centers that incorporates random arrival rates with abandonment to determine staff levels and dynamic ro...
Dimitris Bertsimas, Xuan Vinh Doan
JSAT
2006
87views more  JSAT 2006»
13 years 10 months ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
PAA
2000
13 years 10 months ago
On the Initialisation of Sammon's Nonlinear Mapping
: The initialisation of a neural network implementation of Sammon's mapping, either randomly or based on the principal components (PCs) of the sample covariance matrix, is exp...
Boaz Lerner, Hugo Guterman, Mayer Aladjem, Its'hak...
CCS
2009
ACM
14 years 10 months ago
A generic construction of useful client puzzles
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai