Sciweavers

318 search results - page 20 / 64
» Distributed Graph Traversals by Relabelling Systems with App...
Sort
View
ICS
2000
Tsinghua U.
13 years 11 months ago
Push vs. pull: data movement for linked data structures
As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetchin...
Chia-Lin Yang, Alvin R. Lebeck
ICIP
1999
IEEE
14 years 9 months ago
Water-Filling: A Novel Way for Image Structural Feature Extraction
The performance of a content based image retrieval (CBIR) system is inherently constrained by the features adopted to represent the images in the database. In this paper, a new ap...
Xiang Sean Zhou, Yong Rui, Thomas S. Huang
SAC
2006
ACM
14 years 1 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed
TROB
2008
159views more  TROB 2008»
13 years 7 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas
IPPS
1998
IEEE
14 years 4 days ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka