47 search results - page 5 / 10 » Approximate Constrained Subgraph Matching |
108
click to vote
FGR
2004
IEEE
15 years 5 months ago
2004
IEEE
We consider the problem of robustly and accurately locating facial features. The relative positions of different feature points are represented using a statistical shape model. We...
145
click to vote
NIPS
2004
15 years 2 months ago
2004
It has been demonstrated that basic aspects of human visual motion perception are qualitatively consistent with a Bayesian estimation framework, where the prior probability distri...
119
click to vote
WWW
2009
ACM
16 years 2 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
122
click to vote
DEXA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
159
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...