587 search results - page 34 / 118 » Theory of matching pursuit |
WACV
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this work, we present a formalization of the video synchronization problem that exposes new variants of the problem that have been left unexplored to date. We also present a...
NIPS
2004
13 years 8 months ago
2004
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
ICAPR
2005
Springer
14 years 28 days ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
APSEC
2002
IEEE
14 years 11 days ago
2002
IEEE
Many automated programming environments construct software by integrating predefined components from a software library. A fundamental challenge in this process is to match the p...