Sciweavers

4128 search results - page 634 / 826
» Learning and using relational theories
Sort
View
DEDS
2007
104views more  DEDS 2007»
14 years 10 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
SIAMSC
2008
127views more  SIAMSC 2008»
14 years 10 months ago
On Diagonally Relaxed Orthogonal Projection Methods
Abstract. We propose and study a block-iterative projections method for solving linear equations and/or inequalities. The method allows diagonal component-wise relaxation in conjun...
Yair Censor, Tommy Elfving, Gabor T. Herman, Toura...
TIT
2011
102views more  TIT 2011»
14 years 5 months ago
Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...
Kai-Uwe Schmidt
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 11 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
15 years 7 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long