2423 search results - page 387 / 485 » AnswerArt - Contextualized Question Answering |
196
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
206
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
175
click to vote
ESORICS
2012
Springer
13 years 8 months ago
2012
Springer
Large numbers of people all over the world read and contribute to various review sites. Many contributors are understandably concerned about privacy in general and, specifically,...
156
click to vote
NDJFL
1998
15 years 6 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
169
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
We present enhancements for UDDI / DAML-S registries allowing cooperative discovery and selection of Web services with a focus on personalization. To find the most useful service ...