2168 search results - page 295 / 434 » Randomized Algorithms and Complexity Theory |
127
Voted
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
138
click to vote
MOBICOM
2004
ACM
15 years 8 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
143
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
218
click to vote
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
143
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...