Sciweavers

2239 search results - page 40 / 448
» Computing with abstract matrix structures
Sort
View
TCS
2011
14 years 6 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
PCM
2004
Springer
112views Multimedia» more  PCM 2004»
15 years 5 months ago
A Region Based Image Matching Method with Regularized SAR Model
Abstract. In this paper, we propose a new region-based image matching method to find the user defined regions in other images. We use color histogram and SAR (simultaneous autore...
Yaowei Wang, Weiqiang Wang, Yanfei Wang
DATESO
2004
118views Database» more  DATESO 2004»
15 years 1 months ago
LSI vs. Wordnet Ontology in Dimension Reduction for Information Retrieval
Abstract. In the area of information retrieval, the dimension of document vectors plays an important role. Firstly, with higher dimensions index structures suffer the "curse o...
Pavel Moravec, Michal Kolovrat, Václav Sn&a...
APLAS
2006
ACM
15 years 5 months ago
Proof Abstraction for Imperative Languages
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
William L. Harrison
CSDA
2006
71views more  CSDA 2006»
14 years 11 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang