Sciweavers

2738 search results - page 128 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
189
Voted
COMPULOG
1999
Springer
15 years 11 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
ICASSP
2010
IEEE
15 years 7 months ago
Semi-Supervised Fisher Linear Discriminant (SFLD)
Supervised learning uses a training set of labeled examples to compute a classifier which is a mapping from feature vectors to class labels. The success of a learning algorithm i...
Seda Remus, Carlo Tomasi
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris

Book
2651views
17 years 4 months ago
Object Oriented Programming with ANSI-C
"This book is not going to praise object-oriented programming or condemn the Old Way. We are simply going to use ANSI-C to discover how object-oriented programming is done, w...
Axel-Tobias Schreiner
ICC
2009
IEEE
117views Communications» more  ICC 2009»
16 years 1 months ago
Two Phase Spectrum Sharing for Frequency-Agile Radio Networks
Abstract—Modern frequency-agile radios are capable of dynamically changing the spectrum width and central frequency of its channels. Existing spectrum sharing algorithms often fa...
Zhenhua Feng, Yaling Yang