Sciweavers

3208 search results - page 479 / 642
» A Lower Bound for Primality
Sort
View
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
16 years 7 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
CHI
2007
ACM
16 years 7 months ago
Pressure marks
Selections and actions in GUI's are often separated ? i.e. an action or command typically follows a selection. This sequence imposes a lower bound on the interaction time tha...
Gonzalo A. Ramos, Ravin Balakrishnan
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 6 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 6 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 6 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano