Sciweavers

501 search results - page 47 / 101
» Rough Sets and Approximation Schemes
Sort
View
ICCD
2007
IEEE
195views Hardware» more  ICCD 2007»
14 years 1 months ago
LEMap: Controlling leakage in large chip-multiprocessor caches via profile-guided virtual address translation
The emerging trend of larger number of cores or processors on a single chip in the server, desktop, and mobile notebook platforms necessarily demands larger amount of on-chip last...
Jugash Chandarlapati, Mainak Chaudhuri
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 10 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
14 years 3 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
14 years 4 months ago
ICSPEA: evolutionary five-axis milling path optimisation
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
Jörn Mehnen, Rajkumar Roy, Petra Kersting, To...