Sciweavers

2042 search results - page 360 / 409
» Variable Number of
Sort
View
IPL
2002
125views more  IPL 2002»
14 years 10 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
MMS
1998
14 years 10 months ago
Packet Audio Playout Delay Adjustment: Performance Bounds and Algorithms
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
Sue B. Moon, James F. Kurose, Donald F. Towsley
CSDA
2007
169views more  CSDA 2007»
14 years 10 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
IANDC
2010
84views more  IANDC 2010»
14 years 9 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit deï...
Arie Matsliah, Ofer Strichman
BMVC
2010
14 years 8 months ago
Improved Anatomical Landmark Localization in Medical Images Using Dense Matching of Graphical Models
We propose a method for reliably and accurately identifying anatomical landmarks in 3D CT volumes based on dense matching of parts-based graphical models. Such a system can be use...
Vaclav Potesil, Timor Kadir, Günther Platsch,...