Sciweavers

2150 search results - page 110 / 430
» On a restricted cross-intersection problem
Sort
View
JDA
2008
85views more  JDA 2008»
15 years 4 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
MOC
2000
78views more  MOC 2000»
15 years 4 months ago
Using number fields to compute logarithms in finite fields
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
Oliver Schirokauer
JAIR
2002
134views more  JAIR 2002»
15 years 4 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
DAM
2010
104views more  DAM 2010»
15 years 3 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
CORR
2009
Springer
91views Education» more  CORR 2009»
15 years 2 months ago
On the Number of Membranes in Unary P Systems
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems...
Rudolf Freund, Andreas Klein, Martin Kutrib