Sciweavers

953 search results - page 72 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
MST
2010
146views more  MST 2010»
13 years 2 months ago
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
Rezaul Alam Chowdhury, Vijaya Ramachandran
ANLP
1994
97views more  ANLP 1994»
13 years 9 months ago
Recycling Terms into a Partial Parser
Both full-text information retrieval and large scale parsing require text preprocessing to identify strong lexical associations in textual databases. In order to associate linguis...
Christian Jacquemin
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
ECCV
2010
Springer
14 years 1 months ago
Affine Puzzle: Realigning Deformed Object Fragments without Correspondences
This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method ...
Csaba Domokos and Zoltan Kato
IJCAI
2007
13 years 9 months ago
Coalitional Bargaining with Agent Type Uncertainty
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
Georgios Chalkiadakis, Craig Boutilier