3653 search results - page 156 / 731 » On Recognizable Timed Languages |
103
click to vote
NIPS
2000
14 years 11 months ago
2000
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
92
Voted
CHI
2009
ACM
15 years 10 months ago
2009
ACM
Much of the work done in the field of tangible interaction has focused on creating tools for learning; however, in many cases, little evidence has been provided that tangible inte...
100
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
75
Voted
LCPC
2005
Springer
15 years 3 months ago
2005
Springer
Programming network processors remains a challenging task since their birth until recently when high-level programming environments for them are emerging. By employing domain speci...
111
click to vote
COMPSAC
2002
IEEE
15 years 3 months ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...