Sciweavers

4744 search results - page 149 / 949
» Connected Computing
Sort
View
ICALP
2004
Springer
15 years 8 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
MVA
1994
138views Computer Vision» more  MVA 1994»
15 years 4 months ago
A High-Speed Document Image Classifier
In this paper, a high-speed document image classification algorithm is presented. The algorithm is based on the bottom-up strategy which can successfully segment and classify any ...
Lejun Shao
FCS
2009
15 years 1 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
SIGGRAPH
2000
ACM
15 years 7 months ago
Progressive geometry compression
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...
Andrei Khodakovsky, Peter Schröder, Wim Sweld...
CCGRID
2006
IEEE
15 years 9 months ago
GridFTP-APT: Automatic Parallelism Tuning Mechanism for Data Transfer Protocol GridFTP
GridFTP has been used as a data transfer protocol to effectively transfer a large volume of data in Grid computing. GridFTP supports a feature called parallel data transfer that i...
Takeshi Ito, Hiroyuki Ohsaki, Makoto Imase