Sciweavers

16994 search results - page 3087 / 3399
» Improving the Performance of maxRPC
Sort
View
177
Voted
MOBIHOC
2001
ACM
16 years 7 months ago
Implicit source routes for on-demand ad hoc network routing
In an ad hoc network, the use of source routing has many advantages, including simplicity, correctness, and flexibility. For example, all routing decisions for a packet are made b...
Yih-Chun Hu, David B. Johnson
242
Voted

Publication
353views
16 years 5 months ago
Shape from Shading with Perspective Projection
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
Kyoung Mu Lee (Seoul National University), C.-C. J...
PPOPP
2010
ACM
16 years 4 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
289
Voted
PPOPP
2010
ACM
16 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
201
Voted
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 4 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
« Prev « First page 3087 / 3399 Last » Next »