Sciweavers

19700 search results - page 111 / 3940
» DNA-Based Computation Times
Sort
View
CASES
2009
ACM
14 years 7 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
ICDCSW
2005
IEEE
15 years 3 months ago
Framework and Rule-Based Language for Facilitating Context-Aware Computing Using Information Appliances
Recently, context-aware computing with information appliances is the topic of many research efforts. In order to realize context-aware systems, it is necessary to describe rules, ...
Kouji Nishigaki, Keiichi Yasumoto, Naoki Shibata, ...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 8 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
SRDS
2010
IEEE
14 years 8 months ago
A Cooperative Sampling Approach to Discovering Optimal Configurations in Large Scale Computing Systems
With the growing scale of current computing systems, traditional configuration tuning methods become less effective because they usually assume a small number of parameters in the...
Haifeng Chen, Guofei Jiang, Hui Zhang 0002, Kenji ...
WINE
2010
Springer
201views Economy» more  WINE 2010»
14 years 8 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...