TCS
2011
14 years 23 days ago
2011
TCS
2011
14 years 23 days ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
TCS
2011
14 years 23 days ago
2011
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
TCS
2011
14 years 23 days ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
TCS
2011
14 years 23 days ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
TCS
2011
14 years 23 days ago
2011
This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifie...
TCS
2011
14 years 23 days ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
TCS
2011
14 years 23 days ago
2011
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
TCS
2011
14 years 23 days ago
2011
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
TCS
2011
14 years 23 days ago
2011
