Sciweavers

2272 search results - page 453 / 455
» Capture Complexity by Partition
Sort
View
CORR
2011
Springer
178views Education» more  CORR 2011»
12 years 11 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
PODC
2011
ACM
12 years 10 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
12 years 10 months ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
CCS
2011
ACM
12 years 7 months ago
Fear the EAR: discovering and mitigating execution after redirect vulnerabilities
The complexity of modern web applications makes it difficult for developers to fully understand the security implications of their code. Attackers exploit the resulting security v...
Adam Doupé, Bryce Boe, Christopher Kruegel,...