Sciweavers

3890 search results - page 174 / 778
» Computation of unirational fields
Sort
View
190
Voted
SMI
1999
IEEE
111views Image Analysis» more  SMI 1999»
15 years 11 months ago
Computational Topology for Shape Modeling
This paper expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in par...
John C. Hart
TCS
2008
15 years 7 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
QOFIS
2000
Springer
15 years 10 months ago
The Fairness Challenge in Computer Networks
Abstract. In this paper, the concept of fairness as a future field of research in computer networks is investigated. We motivate the need of examining fairness issues by providing ...
Robert Denda, Albert Banchs, Wolfgang Effelsberg
171
Voted
AIIDE
2008
15 years 9 months ago
Explicit Knowledge Programming for Computer Games
The main aim of this paper is to raise awareness of higherorder knowledge (knowledge about someone else's knowledge) as an issue for computer game AI. We argue that a number ...
Andreas Witzel, Jonathan A. Zvesper, Ethan Kennerl...
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
15 years 9 months ago
Computing Hilbert Class Polynomials
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
Juliana Belding, Reinier Bröker, Andreas Enge...