Sciweavers

3466 search results - page 53 / 694
» Fast computation of special resultants
Sort
View
ACL
2010
13 years 9 months ago
Temporal Information Processing of a New Language: Fast Porting with Minimal Resources
We describe the semi-automatic adaptation of a TimeML annotated corpus from English to Portuguese, a language for which TimeML annotated data was not available yet. In order to va...
Francisco Costa, António Branco
GD
2004
Springer
14 years 4 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
SAC
2008
ACM
13 years 10 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
SIGGRAPH
1994
ACM
14 years 3 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume
ARITH
2001
IEEE
14 years 2 months ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee