Sciweavers

40 search results - page 7 / 8
» approx 2007
Sort
View
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 2 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
14 years 2 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
CIVR
2007
Springer
139views Image Analysis» more  CIVR 2007»
14 years 2 months ago
Video search in concept subspace: a text-like paradigm
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...
Xirong Li, Dong Wang, Jianmin Li, Bo Zhang
SEMWEB
2007
Springer
14 years 2 months ago
Matching Patient Records to Clinical Trials Using Ontologies
Abstract. This paper describes a large case study that explores the applicability of ontology reasoning to problems in the medical domain. We investigate whether it is possible to ...
Chintan Patel, James J. Cimino, Julian Dolby, Achi...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 2 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...