1445 search results - page 61 / 289 » Uniformly Hard Languages |
103
click to vote
JUCS
2002
15 years 3 months ago
2002
: We consider a uniform way of treating objects and rules in P systems: we start with multisets of rules, which are consumed when they are applied, but the application of a rule ma...
133
Voted
WAIM
2010
Springer
15 years 2 months ago
2010
Springer
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
112
Voted
SIGIR
2003
ACM
15 years 9 months ago
2003
ACM
Latent Dirichlet Allocation (LDA) is a fully generative approach to language modelling which overcomes the inconsistent generative semantics of Probabilistic Latent Semantic Index...
217
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
126
click to vote
SDL
2007
15 years 5 months ago
2007
Abstract. It is still the case that language descriptions have lots of semantic information captured using plain (English) text. These imprecise descriptions are hardly usable for ...