Sciweavers

4926 search results - page 875 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
DEXAW
2004
IEEE
123views Database» more  DEXAW 2004»
13 years 11 months ago
Self-Adaptive and Self-Optimising Resource Monitoring for Dynamic Grid Environments
As the number of resources on the Grid tends to be very dynamic and potentially large, it becomes increasingly important to discover and monitor them efficiently. This paper conce...
Helene N. Lim Choi Keung, Justin R. D. Dyson, Step...
ATAL
2008
Springer
13 years 9 months ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
ICML
2010
IEEE
13 years 9 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
COR
2006
113views more  COR 2006»
13 years 7 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
JEI
2002
88views more  JEI 2002»
13 years 7 months ago
Natural image database and its use for scene illuminant estimation
This paper describes a database collecting natural color images, called the Natural Image Database, and shows how it is used for illuminant estimation problems. First, we present ...
Shoji Tominaga