Sciweavers

1220 search results - page 79 / 244
» Restricting grammatical complexity
Sort
View
JDA
2008
85views more  JDA 2008»
13 years 7 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...
DAM
2007
83views more  DAM 2007»
13 years 7 months ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys
ADCM
2004
58views more  ADCM 2004»
13 years 7 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...
AEI
2002
70views more  AEI 2002»
13 years 7 months ago
A performance-based approach to wheelchair accessible route analysis
This paper presents a method to determine if a usable wheelchair accessible route in a facility exists using motion-planning techniques. We use a `performance-based' approach...
Charles S. Han, Kincho H. Law, Jean-Claude Latombe...
JAIR
2002
134views more  JAIR 2002»
13 years 7 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