Sciweavers

20175 search results - page 60 / 4035
» Is abstraction the key to computing
Sort
View
121
Voted
ECAI
2010
Springer
15 years 1 months ago
Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
Abstract. Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the...
Tomasz P. Michalak, Talal Rahwan, Dorota Marciniak...
94
Voted
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 19 days ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
WSC
2007
15 years 2 months ago
A co-design modeling approach for computer network systems
Co-design modeling is considered key toward handling the complexity and scale of network systems. The ability to separately specify the software and hardware aspects of computer n...
Weilong Hu, Hessam S. Sarjoughian
98
Voted
DBSEC
2007
104views Database» more  DBSEC 2007»
15 years 2 months ago
New Paradigm of Inference Control with Trusted Computing
Abstract. The database server is a crucial bottleneck in traditional inference control architecture, as it enforces highly computation-intensive auditing for all users who query th...
Yanjiang Yang, Yingjiu Li, Robert H. Deng
SIAMSC
2008
127views more  SIAMSC 2008»
15 years 14 days ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu