Sciweavers

1055 search results - page 145 / 211
» Enumerations in computable structure theory
Sort
View
AI
2000
Springer
13 years 10 months ago
On agent-based software engineering
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
Nicholas R. Jennings
ICCV
2009
IEEE
13 years 8 months ago
Improving accuracy of geometric parameter estimation using projected score method
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...
Takayuki Okatani, Koichiro Deguchi
COMPGEOM
2010
ACM
14 years 3 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
ICA3PP
2010
Springer
14 years 2 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
WWW
2004
ACM
14 years 10 months ago
Authoring of learning styles in adaptive hypermedia: problems and solutions
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
Natalia Stash, Alexandra I. Cristea, Paul De Bra