Sciweavers

705 search results - page 130 / 141
» Constraint-based Modeling and Ambiguity
Sort
View
COLING
1996
15 years 1 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
BMCBI
2006
148views more  BMCBI 2006»
14 years 11 months ago
Predicting Class II MHC-Peptide binding: a kernel based approach using similarity scores
Background: Modelling the interaction between potentially antigenic peptides and Major Histocompatibility Complex (MHC) molecules is a key step in identifying potential T-cell epi...
Jesper Salomon, Darren R. Flower
FLAIRS
2009
14 years 9 months ago
Analyzing Team Actions with Cascading HMM
While team action recognition has a relatively extended literature, less attention has been given to the detailed realtime analysis of the internal structure of the team actions. ...
Brandyn Allen White, Nate Blaylock, Ladislau B&oum...
WWW
2011
ACM
14 years 6 months ago
Search result diversity for informational queries
Ambiguous queries constitute a significant fraction of search instances and pose real challenges to web search engines. With current approaches the top results for these queries ...
Michael J. Welch, Junghoo Cho, Christopher Olston
POPL
2008
ACM
16 years 2 hour ago
A theory of platform-dependent low-level software
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
Marius Nita, Dan Grossman, Craig Chambers