Sciweavers

114 search results - page 10 / 23
» Dynamic Spatial Approximation Trees for Massive Data
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 8 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
BMCBI
2005
137views more  BMCBI 2005»
13 years 7 months ago
A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...
Olivier Bastien, Philippe Ortet, Sylvaine Roy, Eri...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CVPR
2005
IEEE
14 years 10 months ago
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
Qiang Ji, Yang Wang 0002