Sciweavers

8243 search results - page 1634 / 1649
» Can We Manage Trust
Sort
View
IPPS
2002
IEEE
14 years 1 months ago
Enforcing Resource Sharing Agreements among Distributed Server Clusters
Future scalable, high throughput, and high performance applications are likely to execute on platforms constructed by clustering multiple autonomous distributed servers, with reso...
Tao Zhao, Vijay Karamcheti
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 1 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...
ASPLOS
2000
ACM
14 years 1 months ago
Hoard: A Scalable Memory Allocator for Multithreaded Applications
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applic...
Emery D. Berger, Kathryn S. McKinley, Robert D. Bl...
SIGUCCS
2000
ACM
14 years 1 months ago
Training... A Key to Better Help Desk Consultants
The quality of student consultants and their development through training and education are major factors in determining long-term effectiveness of university Help Desk. To hire a...
Anna Maria Perez, Andrea J. Moore
COMPUTE
2010
ACM
14 years 29 days ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
« Prev « First page 1634 / 1649 Last » Next »