Sciweavers

47 search results - page 5 / 10
» Approximate Constrained Subgraph Matching
Sort
View
FGR
2004
IEEE
160views Biometrics» more  FGR 2004»
14 years 4 days ago
A Comparison of Shape Constrained Facial Feature Detectors
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...
David Cristinacce, Timothy F. Cootes
NIPS
2004
13 years 9 months ago
Constraining a Bayesian Model of Human Visual Speed Perception
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...
Alan Stocker, Eero P. Simoncelli
WWW
2009
ACM
14 years 9 months ago
Bid optimization for broad match ad auctions
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...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
DEXA
2009
Springer
153views Database» more  DEXA 2009»
14 years 9 days ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
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 ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
ICALP
2001
Springer
14 years 27 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
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 ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan