1964 search results - page 129 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
161
click to vote
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
135
Voted
ICMLA
2009
15 years 4 days ago
2009
Sparse representation for machine learning has been exploited in past years. Several sparse representation based classification algorithms have been developed for some application...
144
Voted
ADMA
2006
Springer
15 years 8 months ago
2006
Springer
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be i...
133
Voted
XSYM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The eXtensible Markup Language (XML) provides a powerful and flexible means of encoding and exchanging data. As it turns out, its main advantage as an encoding format (n...
112
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...