Sciweavers

2485 search results - page 244 / 497
» Time Bounded Frequency Computations
Sort
View
CVPR
2010
IEEE
15 years 3 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
FCT
1997
Springer
15 years 7 months ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis
TCOM
2010
101views more  TCOM 2010»
14 years 10 months ago
Spectral efficient transmit diversity techniques without cyclic prefix for fading relay channels
Abstract--This paper proposes spectral efficient relayassisted transmit diversity techniques, i.e., space-time and space-frequency block codes (STBC/SFBC), for single carrier frequ...
Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
16 years 3 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
IPPS
2007
IEEE
15 years 9 months ago
A Fault Tolerance Protocol with Fast Fault Recovery
Fault tolerance is an important issue for large machines with tens or hundreds of thousands of processors. Checkpoint-based methods, currently used on most machines, rollback all ...
Sayantan Chakravorty, Laxmikant V. Kalé