Sciweavers

900 search results - page 17 / 180
» Metric Structures and Probabilistic Computation
Sort
View
COLING
1996
13 years 9 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
JPDC
2008
122views more  JPDC 2008»
13 years 7 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
ENTCS
2008
120views more  ENTCS 2008»
13 years 7 months ago
Semantic Abstraction and Quantum Computation
abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...
Alessandra Di Pierro, Herbert Wiklicky
ECCV
2008
Springer
14 years 9 months ago
Output Regularized Metric Learning with Side Information
Distance metric learning has been widely investigated in machine learning and information retrieval. In this paper, we study a particular content-based image retrieval application ...
Wei Liu, Steven C. H. Hoi, Jianzhuang Liu
UAI
2001
13 years 9 months ago
Similarity Measures on Preference Structures, Part II: Utility Functions
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
Vu A. Ha, Peter Haddawy, John Miyamoto