Sciweavers

9387 search results - page 1471 / 1878
» An Optimal Process Model for a Real Time Process
Sort
View
IAJIT
2010
87views more  IAJIT 2010»
15 years 5 months ago
A performance comparison of MD5 authenticated routing traffic with EIGRP, RIPv2, and OSPF
: Routing is the process of forwarding data across an inter-network from a designated source to a final destination. Along the way from source to destination, at least one intermed...
Khalid Abu Al-Saud, Hatim Mohd Tahir, Moutaz Saleh...
ICCV
2003
IEEE
16 years 8 months ago
Entropy-of-likelihood Feature Selection for Image Correspondence
Feature points for image correspondence are often selected according to subjective criteria (e.g. edge density, nostrils). In this paper, we present a general, non-subjective crit...
Matthew Toews, Tal Arbel
ICCV
1999
IEEE
16 years 8 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
ICML
2004
IEEE
16 years 7 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 7 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
« Prev « First page 1471 / 1878 Last » Next »