Sciweavers

13987 search results - page 534 / 2798
» The Two Guards Problem
Sort
View
JGAA
2002
81views more  JGAA 2002»
15 years 6 months ago
Graph Drawing in Motion
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
Carsten Friedrich, Peter Eades
MVA
2002
144views Computer Vision» more  MVA 2002»
15 years 6 months ago
Fingerprint Identification Using the Accidental Coincidence Probability
A method of comparing and identifying two patterns is proposed based on the accidental coincidence probability of the patterns' features. The probability is calculated under ...
Akira Monden, Seiji Yoshimoto
PRL
2002
89views more  PRL 2002»
15 years 6 months ago
Rejection based classifier for face detection
Pattern detection problems require a separation between two classes, Target and Clutter, where the probability of the former is substantially smaller compared to that of the latte...
Michael Elad, Yacov Hel-Or, Renato Keshet
PE
2010
Springer
129views Optimization» more  PE 2010»
15 years 5 months ago
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
TPDS
2010
98views more  TPDS 2010»
15 years 5 months ago
Minimum Latency Gossiping in Radio Networks
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....