Sciweavers

2950 search results - page 163 / 590
» Computing with Infinitely Many Processes
Sort
View
ISCI
2006
58views more  ISCI 2006»
15 years 6 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley
153
Voted
ICIP
2001
IEEE
16 years 7 months ago
Fast algorithms for DCT-domain video transcoding
Video transcoding is an efficient way for. rate adaptation and format conversion in various networked video applications. Many transcoder architectures have been proposed to achie...
Chia-Wen Lin, Yuh-Ruey Lee
SAC
2010
ACM
16 years 1 months ago
A deidealisation semantics for KAOS
KAOS is a goal directed requirements engineering framework based on the decomposition and refinement of goals. Decomposition and refinement continue until a point is reached at ...
Richard Banach
SI3D
2006
ACM
16 years 3 days ago
Jump flooding in GPU with applications to Voronoi diagram and distance transform
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
Guodong Rong, Tiow Seng Tan
ISCI
2002
132views more  ISCI 2002»
15 years 5 months ago
Mobile data and transaction management
Mobile computing paradigm has emerged due to advances in wireless or cellular networking technology. This rapidly expanding technology poses many challenging research problems in ...
Sanjay Kumar Madria, Mukesh K. Mohania, Sourav S. ...