Sciweavers

4908 search results - page 63 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
VR
2000
IEEE
114views Virtual Reality» more  VR 2000»
15 years 9 months ago
Virtual Fekete Point Configurations: A Case Study in Perturbing Complex Systems
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
Robert van Liere, Jurriaan D. Mulder, Jason Frank,...
EMNLP
2008
15 years 7 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
AIPS
2006
15 years 7 months ago
New Complexity Results for Classical Planning Benchmarks
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
Malte Helmert
AI
2005
Springer
15 years 6 months ago
The complexity of contract negotiation
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
Paul E. Dunne, Michael Wooldridge, Michael Laurenc...
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa