8196 search results - page 1380 / 1640 » Computational Modeling and Complexity Science |
138
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
137
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
146
Voted
HICSS
2006
IEEE
15 years 10 months ago
2006
IEEE
: e-business organizations are heavily dependent on distributed 24X7 robust information computing systems, for their daily operations. To secure distributed online transactions, th...
139
click to vote
HRI
2006
ACM
15 years 10 months ago
2006
ACM
We present a method of grounded word learning that is powerful enough to learn the meanings of first and second person pronouns. The model uses the understood words in an utteran...
142
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...