Sciweavers

224 search results - page 23 / 45
» Homogeneous Decomposition of Polynomials
Sort
View
DKE
2002
113views more  DKE 2002»
15 years 8 days ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
90
Voted
IPPS
2009
IEEE
15 years 7 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
101
Voted
ICIP
2005
IEEE
16 years 2 months ago
Coupled geometric and texture PDE-based segmentation
In this paper, along with recent trends in segmentation using multiple image cues, we examine the integration of modulation texture features, image contrast and region size for de...
Anastasia Sofou, Georgios Evangelopoulos, Petros M...
101
Voted
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 15 days ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
89
Voted
MOC
2010
14 years 7 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler