7066 search results - page 300 / 1414 » Contact Relations with Applications |
200
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
154
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
156
click to vote
AUSAI
2007
Springer
16 years 26 days ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
154
click to vote
ISCAS
2006
IEEE
16 years 21 days ago
2006
IEEE
the following cost functions: In this paper, learning rules are proposed for simultaneous corn- GI(U) = tr{(UTU)(UTBU)-lD, (la) putation of minor eigenvectors of a covariance matri...
184
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...