Sciweavers

6317 search results - page 1226 / 1264
» System Support for Pervasive Applications
Sort
View
WISE
2005
Springer
14 years 2 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
14 years 2 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
OOPSLA
2005
Springer
14 years 2 months ago
Relational queries over program traces
Instrumenting programs with code to monitor runtime behavior is a common technique for profiling and debugging. In practice, instrumentation is either inserted manually by progra...
Simon Goldsmith, Robert O'Callahan, Alexander Aike...
DEXA
2005
Springer
108views Database» more  DEXA 2005»
14 years 2 months ago
Quality-Aware Replication of Multimedia Data
In contrast to alpha-numerical data, multimedia data can have a wide range of quality parameters such as spatial and temporal resolution, and compression format. Users can request ...
Yi-Cheng Tu, Jingfeng Yan, Sunil Prabhakar
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
« Prev « First page 1226 / 1264 Last » Next »