Sciweavers

19320 search results - page 362 / 3864
» On the complexity of computing determinants
Sort
View
COMPGEOM
2006
ACM
16 years 23 days ago
The predicates for the Voronoi diagram of ellipses
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
ACIVS
2005
Springer
16 years 10 days ago
Reduced-Bit, Full Search Block-Matching Algorithms and Their Hardware Realizations
Abstract. The Full Search Block-Matching Motion Estimation (FSBME) algorithm is often employed in video coding for its regular dataflow and straightforward architectures. By iterat...
Vincent M. Dwyer, Shahrukh Agha, Vassilios A. Chou...
HIPC
2004
Springer
16 years 5 days ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
WSNA
2003
ACM
16 years 1 days ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
SCALESPACE
2001
Springer
15 years 11 months ago
Down-Scaling for Better Transform Compression
Abstract. The most popular lossy image compression method used on the Internet is the JPEG standard. JPEG’s good compression performance and low computational and memory complexi...
Alfred M. Bruckstein, Michael Elad, Ron Kimmel