Sciweavers

3946 search results - page 689 / 790
» The computational complexity of choice sets
Sort
View
JAISE
2010
182views Algorithms» more  JAISE 2010»
15 years 1 months ago
Exploring semantics in activity recognition using context lattices
Studying human activities has significant implication in human beneficial applications such as personal healthcare. This research has been facilitated by the development of sensor ...
Juan Ye, Simon Dobson
MMAS
2010
Springer
15 years 1 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
PE
2010
Springer
124views Optimization» more  PE 2010»
15 years 1 months ago
High-level approach to modeling of observed system behavior
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of cap...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
15 years 1 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
SIGGRAPH
2010
ACM
15 years 11 months ago
RepFinder: Finding Approximately Repeated Scene Elements for Image Editing
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
Ming-Ming Cheng, Fang-Lue Zhang, Niloy J. Mitra, X...