Sciweavers

4303 search results - page 29 / 861
» Are We There Yet
Sort
View
APAL
2005
82views more  APAL 2005»
13 years 10 months ago
Forcing indestructibility of MAD families
Let A [] be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indest...
Jörg Brendle, Shunsuke Yatabe
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
14 years 4 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan
ACISP
2005
Springer
14 years 4 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
JAIR
2002
134views more  JAIR 2002»
13 years 10 months ago
Specific-to-General Learning for Temporal Events with Application to Learning Event Definitions from Video
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
Alan Fern, Robert Givan, Jeffrey Mark Siskind
CORR
2010
Springer
197views Education» more  CORR 2010»
13 years 8 months ago
Quantum Strategic Game Theory
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relatio...
Shengyu Zhang