Sciweavers

806 search results - page 112 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
ICC
2009
IEEE
150views Communications» more  ICC 2009»
13 years 5 months ago
Efficient Resource Discovery in Mobile Ad Hoc Networks
Abstract--The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource di...
Ravi Thanawala, Jie Wu, Avinash Srinivasan
BMCBI
2002
129views more  BMCBI 2002»
13 years 7 months ago
SeqHound: biological sequence and structure database as a platform for bioinformatics research
Background: SeqHound has been developed as an integrated biological sequence, taxonomy, annotation and 3-D structure database system. It provides a high-performance server platfor...
Katerina Michalickova, Gary D. Bader, Michel Dumon...
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 7 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 12 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu