Sciweavers

1176 search results - page 208 / 236
» Theory and Applications of Robust Optimization
Sort
View
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 2 days ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
PODC
2009
ACM
16 years 9 days ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
SPAA
2003
ACM
15 years 5 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
DAGM
2003
Springer
15 years 5 months ago
Splines and Wavelets: New Perspectives for Pattern Recognition
We provide an overview of spline and wavelet techniques with an emphasis on applications in pattern recognition. The presentation is divided in three parts. In the first one, we ar...
Michael Unser