4940 search results - page 660 / 988 » On the Complexity of Universal Programs |
214
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
163
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
213
click to vote
ECOOP
2010
Springer
15 years 11 months ago
2010
Springer
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
173
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
182
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...