Sciweavers

188 search results - page 28 / 38
» Finding Best k Policies
Sort
View
AVBPA
2003
Springer
146views Biometrics» more  AVBPA 2003»
14 years 1 months ago
Dental Biometrics: Human Identification Using Dental Radiographs
Abstract. The goal of forensic dentistry is to identify people based on their dental records, mainly as radiograph images. In this paper we attempt to set forth the foundations of ...
Anil K. Jain, Hong Chen, Silviu Minut
ATAL
2008
Springer
13 years 11 months ago
Identifying beneficial teammates using multi-dimensional trust
Multi-agent teams must be capable of selecting the most beneficial teammates for different situations. Multi-dimensional trustworthiness assessments have been shown significantly ...
Jaesuk Ahn, Xin Sui, David DeAngelis, K. Suzanne B...
CAV
2008
Springer
113views Hardware» more  CAV 2008»
13 years 11 months ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg
DASFAA
2008
IEEE
151views Database» more  DASFAA 2008»
13 years 11 months ago
Efficient Top-k Search Across Heterogeneous XML Data Sources
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Rui Zhou
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro