Sciweavers

4539 search results - page 231 / 908
» Approaches to Compute Workflow Complexity
Sort
View
FOCS
2008
IEEE
15 years 12 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
WWW
2008
ACM
16 years 6 months ago
Improving relevance judgment of web search results with image excerpts
Current web search engines return result pages containing mostly text summary even though the matched web pages may contain informative pictures. A text excerpt (i.e. snippet) is ...
Zhiwei Li, Shuming Shi, Lei Zhang
SAC
2005
ACM
15 years 11 months ago
A hybrid approach for multiresolution modeling of large-scale scientific data
Simulations of complex scientific phenomena involve the execution of massively parallel computer programs. These simulation programs generate large-scale multidimensional data set...
Tina Eliassi-Rad, Terence Critchlow
NDSS
2005
IEEE
15 years 11 months ago
One-Way Isolation: An Effective Approach for Realizing Safe Execution Environments
In this paper, we present an approach for realizing a safe execution environment (SEE) that enables users to “try out” new software (or configuration changes to existing soft...
Weiqing Sun, Zhenkai Liang, V. N. Venkatakrishnan,...
EAGC
2003
Springer
15 years 10 months ago
Automatic Services Discovery, Monitoring and Visualization of Grid Environments: The MapCenter Approach
The complexity of Grid environments is growing as more projects and applications appear in this quick-evolving domain. Widespread applications are distributed over thousands of com...
Franck Bonnassieux, Robert Harakaly, Pascale Prime...