Sciweavers

3708 search results - page 365 / 742
» Approximating Betweenness Centrality
Sort
View
WWW
2010
ACM
16 years 2 days ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
MICRO
2003
IEEE
96views Hardware» more  MICRO 2003»
16 years 1 days ago
Scalable Hardware Memory Disambiguation for High ILP Processors
This paper describes several methods for improving the scalability of memory disambiguation hardware for future high ILP processors. As the number of in-flight instructions grows...
Simha Sethumadhavan, Rajagopalan Desikan, Doug Bur...
SIGUCCS
2003
ACM
16 years 10 hour ago
Teamwork is the heart of technology
IAT Services, the central Information Technology group at the University of Missouri-Columbia, operates computing sites in general access, classroom, and residence hall settings. ...
Tammy Hohlt, Kristina A. Cunningham
SIGUCCS
2003
ACM
16 years 10 hour ago
Implementation of fee-based printing in student computing sites
After years of providing no-cost printing in its computing sites, the University of Delaware (UD) decided to move to a fee-based printing scheme for its student computing sites. T...
Carol Jarom, Steven J. Timmins
ATAL
2003
Springer
16 years 52 min ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling