Sciweavers

12289 search results - page 503 / 2458
» computing 2006
Sort
View
JSC
2006
132views more  JSC 2006»
15 years 6 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
JSC
2006
122views more  JSC 2006»
15 years 6 months ago
An automated prover for Zermelo-Fraenkel set theory in Theorema
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
Wolfgang Windsteiger
148
Voted
MT
2006
101views more  MT 2006»
15 years 6 months ago
EBMT by tree-phrasing
We present a study we conducted to build a repository storing associations between simple dependency treelets in a source language and their corresponding phrases in a target lang...
Philippe Langlais, Fabrizio Gotti
ORL
2006
98views more  ORL 2006»
15 years 6 months ago
The communication complexity of private value single-item auctions
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...
ORL
2006
103views more  ORL 2006»
15 years 6 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa