16404 search results - page 2478 / 3281 » A set coverage problem |
186
click to vote
ICIAP
2007
ACM
16 years 7 months ago
2007
ACM
In particle filter?based visual trackers, dynamic velocity components are typically incorporated into the state update equations. In these cases, there is a risk that the uncertai...
163
click to vote
ICIAP
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we address the relatively unexplored problem of classifying texture surfaces undergoing significant levels of non-rigid deformation. State-of-the-art texture classi...
196
click to vote
ICFP
2001
ACM
16 years 7 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
183
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
206
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...