Sciweavers

4403 search results - page 373 / 881
» Galois Theory of Algorithms
Sort
View
WWW
2011
ACM
15 years 1 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
PODS
2012
ACM
240views Database» more  PODS 2012»
13 years 9 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
CVPR
2003
IEEE
16 years 8 months ago
Mean-shift Blob Tracking through Scale Space
The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although the scale of the mean-shift kernel is a crucial parameter, there is presently n...
Robert T. Collins
CVPR
2005
IEEE
16 years 8 months ago
Coupled PDEs for Non-Rigid Registration and Segmentation
In this paper we present coupled partial differential equations (PDEs) for the problem of joint segmentation and registration. The registration component of the method estimates a...
Gozde B. Unal, Gregory G. Slabaugh
CVPR
2006
IEEE
16 years 8 months ago
Efficient Optimal Kernel Placement for Reliable Visual Tracking
This paper describes a novel approach to optimal kernel placement in kernel-based tracking. If kernels are placed at arbitrary places, kernel-based methods are likely to be trappe...
Zhimin Fan, Ming Yang, Ying Wu, Gang Hua, Ting Yu