8669 search results - page 1510 / 1734 » Computing matrix representations |
120
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
134
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
124
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
154
click to vote
ICML
1999
IEEE
16 years 4 months ago
1999
IEEE
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
125
Voted
ICML
1999
IEEE
16 years 4 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...