Sciweavers

588 search results - page 14 / 118
» Reducibility and Completeness in Private Computations
Sort
View
TASLP
2011
13 years 2 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
ICIP
2007
IEEE
14 years 9 months ago
Automatic Parametrisation for an Image Completion Method Based on Markov Random Fields
Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov ...
Huy Tho Ho, Roland Göcke
APPT
2009
Springer
14 years 2 months ago
Evaluating SPLASH-2 Applications Using MapReduce
MapReduce has been prevalent for running data-parallel applications. By hiding other non-functionality parts such as parallelism, fault tolerance and load balance from programmers,...
Shengkai Zhu, Zhiwei Xiao, Haibo Chen, Rong Chen, ...
ICMB
2005
IEEE
118views Business» more  ICMB 2005»
14 years 1 months ago
A Context-Sensitive Service Discovery Protocol for Mobile Computing Environments
Service discovery is important in mobile and pervasive computing environments, where the set of resources available to an entity changes dynamically over time. This paper describe...
Ricky Robinson, Jadwiga Indulska
SIGMETRICS
2009
ACM
151views Hardware» more  SIGMETRICS 2009»
14 years 2 months ago
MapReduce optimization using regulated dynamic prioritization
We present a system for allocating resources in shared data and compute clusters that improves MapReduce job scheduling in three ways. First, the system uses regulated and user-as...
Thomas Sandholm, Kevin Lai