Sciweavers

1243 search results - page 175 / 249
» On the locality of bounded growth
Sort
View
AI
2008
Springer
15 years 6 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne
CAS
2008
118views more  CAS 2008»
15 years 6 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
IEICET
2006
55views more  IEICET 2006»
15 years 6 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
CORR
2007
Springer
87views Education» more  CORR 2007»
15 years 6 months ago
Double Sided Watermark Embedding and Detection with Perceptual Analysis
—In our previous work, we introduced a double-sided technique that utilizes but not reject the host interference. Due to its nice property of utilizing but not rejecting the host...
Jidong Zhong, Shangteng Huang
JPDC
2008
135views more  JPDC 2008»
15 years 6 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward