6315 search results - page 198 / 1263 » Approximating Solution Structure |
183
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
214
click to vote
PAMI
2012
13 years 9 months ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
157
click to vote
FORMATS
2007
Springer
16 years 21 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
180
click to vote
COOPIS
2004
IEEE
15 years 10 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
162
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...