2588 search results - page 292 / 518 » Applications of Kolmogorov complexity to computable model th... |
199
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
173
click to vote
SPAA
2005
ACM
16 years 6 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
225
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
184
click to vote
SEMWEB
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The upper-level ontologies are theories that capture the most common concepts, which are relevant for many of the tasks involving knowledge extraction, representation, an...
184
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...