Sciweavers

1007 search results - page 167 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
TC
2011
14 years 9 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
15 years 6 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
ICIP
2006
IEEE
16 years 4 months ago
Parity-Object Embedded Streaming for Synthetic Graphics
This paper proposes an object-oriented approach for streaming synthetic graphic contents over a packet-erasure channel. Graphic objects such as geometric meshes and texture images...
Dihong Tian, Ghassan Alregib
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
16 years 2 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
TJS
2008
105views more  TJS 2008»
15 years 2 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...