Sciweavers

16666 search results - page 2686 / 3334
» Descriptive and Computational Complexity
Sort
View
INFOVIS
2003
IEEE
16 years 15 days ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris
SIGECOM
2003
ACM
174views ECommerce» more  SIGECOM 2003»
16 years 14 days ago
Collaboration software to reduce inventory and increase response
Some recent trends in business and manufacturing hold the promise of greater profits, yet, due to profit-robbing inventory increases, this promise has not been fully realized. [9]...
Indu Bingham, Barbara Hoefle, Kim Phan, Jim Sizemo...
WPES
2003
ACM
16 years 14 days ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
COMPGEOM
2010
ACM
16 years 9 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
PODS
2010
ACM
215views Database» more  PODS 2010»
16 years 9 days ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
« Prev « First page 2686 / 3334 Last » Next »