Sciweavers

7289 search results - page 385 / 1458
» A Dependent Set Theory
Sort
View
DCC
2010
IEEE
15 years 7 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...
ISVC
2009
Springer
16 years 1 months ago
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
Ioannis Koutis, Gary L. Miller, David Tolliver
AGILE
2008
Springer
120views GIS» more  AGILE 2008»
16 years 1 months ago
A Study on the Cognitive Plausibility of SIM-DL Similarity Rankings for Geographic Feature Types
The SIM-DL theory has been developed to enable similarity measurement between concept specifications using description logics. It thus closes the gap between similarity theories f...
Krzysztof Janowicz, Carsten Keßler, Ilija Pa...
SUM
2007
Springer
16 years 1 months ago
Combining Uncertain Outputs from Multiple Ontology Matchers
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
Ying Wang, Weiru Liu, David A. Bell