Sciweavers

2962 search results - page 137 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 2 months ago
Energy Scaling Laws for Distributed Inference in Random Networks
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
Animashree Anandkumar, Joseph E. Yukich, Lang Tong...
104
Voted
ICIP
2003
IEEE
16 years 4 months ago
Dither-modulation data hiding with distortion-compensation: exact performance analysis and an improved detector for JPEG attacks
The binary Distortion Compensated Dither-Modulation (DCDM), which can be regarded to as a baseline for quantizationbased data-hiding methods, is rigorously analyzed. A novel and a...
Félix Balado, Fernando Pérez-Gonz&aa...
ATAL
2008
Springer
15 years 4 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose
DKE
2006
157views more  DKE 2006»
15 years 2 months ago
XML structural delta mining: Issues and challenges
Recently, there is an increasing research efforts in XML data mining. These research efforts largely assumed that XML documents are static. However, in reality, the documents are ...
Qiankun Zhao, Ling Chen 0002, Sourav S. Bhowmick, ...
JACM
2000
131views more  JACM 2000»
15 years 2 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle