Sciweavers

18572 search results - page 378 / 3715
» High performance C
Sort
View
COCOON
1998
Springer
15 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
IWCMC
2006
ACM
16 years 21 days ago
Effective channel assignment in multi-hop W-CDMA cellular networks
Multi-hop relaying is an important concept in tackling the inherent problems of limited capacity and coverage in cellular networks. It helps to solve the dead-spots problem and to...
Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl
ICS
2000
Tsinghua U.
15 years 10 months ago
Automatic loop transformations and parallelization for Java
From a software engineering perspective, the Java programming language provides an attractive platform for writing numerically intensive applications. A major drawback hampering i...
Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff,...
DEBS
2009
ACM
15 years 10 months ago
Event-based systems: opportunities and challenges at exascale
Streaming data models have been shown to be useful in many applications requiring high-performance data exchange. Application-level overlay networks are a natural way to realize t...
Greg Eisenhauer, Matthew Wolf, Hasan Abbasi, Karst...
DAC
2006
ACM
16 years 7 months ago
Games are up for DVFS
Graphics-intensive computer games are no longer restricted to highperformance desktops, but are also available on a variety of portable devices ranging from notebooks to PDAs and ...
Yan Gu, Samarjit Chakraborty, Wei Tsang Ooi