Sciweavers

2778 search results - page 230 / 556
» Limit complexities revisited
Sort
View
WSC
1997
15 years 8 months ago
Execution-Driven Simulators for Parallel Systems Design
Evaluating, analyzing and predicting the performance of a parallel system is challenging due to the complex inter-play between the application characteristics and architectural fe...
Anand Sivasubramaniam
AAAI
1994
15 years 8 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
COLING
1990
15 years 7 months ago
Finding Translation Equivalents: An Application Of Grammatical Metaphor
In this paper I describe how a significant class of cases that would involve (possibly complex) structural transfer in nmchine translation can be handled avoiding transfer. This i...
John A. Bateman
COLING
1990
15 years 7 months ago
To Parse or Not to Parse: Relation-Driven Text Skimming
We have designed and implemented a text processing system that can extract important information from hundreds of paragraphs per hour and can be transported within weeks to a new ...
Paul S. Jacobs
ICMCS
2010
IEEE
232views Multimedia» more  ICMCS 2010»
15 years 7 months ago
The "3D Wiki": Blending virtual worlds and Web architecture for remote collaboration
While a lot of technical data is available on the Web, conveying information about detailed procedures for the assembly and repair of complex machinery has so far been limited mos...
Michael Roberts, Nicolas Ducheneaut, Trevor F. Smi...