Sciweavers

741 search results - page 69 / 149
» A Markov random field model for term dependencies
Sort
View

Book
361views
16 years 7 months ago
Introduction to Statistical Signal Processing
"A random or stochastic process is a mathematical model for a phenomenon that evolves in time in an unpredictable manner from the viewpoint of the observer. The phenomenon m...
R.M. Gray
ACL
2006
14 years 11 months ago
An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
Vijay Krishnan, Christopher D. Manning
IJCAI
2007
14 years 11 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
ICN
2005
Springer
15 years 3 months ago
Network Traffic Sampling Model on Packet Identification
Spatially coordinated packet sampling can be implemented by using a deterministic function of packet content to determine the selection decision for a given packet. In this way, a...
Guang Cheng, Jian Gong, Wei Ding 0001
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam