Sciweavers

3690 search results - page 248 / 738
» Computation with classical sequents
Sort
View
90
Voted
FCT
2005
Springer
15 years 6 months ago
The Complexity of Semilinear Problems in Succinct Representation
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
Peter Bürgisser, Felipe Cucker, Paulin Jacob&...
106
Voted
RSFDGRC
2005
Springer
151views Data Mining» more  RSFDGRC 2005»
15 years 6 months ago
DIXER - Distributed Executor for Rough Set Exploration System
We present the Distributed Executor for RSES (DIXER) which is a supplementary software for the Rough Set Exploration System (RSES). It takes an advantage of grid computing paradigm...
Jan G. Bazan, Rafal Latkowski, Marcin S. Szczuka
86
Voted
ICPR
2010
IEEE
15 years 6 months ago
2D Shape Recognition Using Information Theoretic Kernels
In this paper, a novel approach for contour-based 2D shape recognition is proposed, using a recently introduced class of information theoretic kernels. This kind of kernels, based...
Manuele Bicego, André Filipe Torres Martins, Vitt...
ICPP
2003
IEEE
15 years 6 months ago
Performance of a Heterogeneous Grid Partitioner for N-body Applications
An important characteristic of distributed grids is that they allow geographically separated multicomputers to be tied together in a transparent virtual environment to solve large...
Daniel J. Harvey, Sajal K. Das, Rupak Biswas
105
Voted
SIBGRAPI
2003
IEEE
15 years 6 months ago
A Non-Self-Intersection Douglas-Peucker Algorithm
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensivel...
Shin-Ting Wu, Mercedes Rocío Gonzales M&aac...