Sciweavers

372 search results - page 47 / 75
» A Study of The Fragile Base Class Problem
Sort
View
CLUSTER
2004
IEEE
15 years 1 months ago
Towards provision of quality of service guarantees in job scheduling
Considerable research has focused on the problem of scheduling dynamically arriving independent parallel jobs on a given set of resources. There has also been some recent work in ...
Mohammad Islam, Pavan Balaji, P. Sadayappan, Dhaba...
SOFSEM
2000
Springer
15 years 1 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
15 years 10 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
FOCS
2006
IEEE
15 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
ICPR
2008
IEEE
15 years 4 months ago
Interactive feature visualization for image retrieval
Most systems for content based image retrieval (CBIR) employ low level image features as a similarity measure. The problem of CBIR systems is that they are a “black box” to th...
Johannes Imo, Sebastian Klenk, Gunther Heidemann