Sciweavers

456 search results - page 80 / 92
» Extending Problem Frames to deal with stakeholder problems
Sort
View
SIGIR
2010
ACM
15 years 27 days ago
Temporally-aware algorithms for document classification
Automatic Document Classification (ADC) is still one of the major information retrieval problems. It usually employs a supervised learning strategy, where we first build a classif...
Thiago Salles, Leonardo C. da Rocha, Gisele L. Pap...
TSP
2010
15 years 25 days ago
Closed-form MMSE estimation for signal denoising under sparse representation modeling over a unitary dictionary
This paper deals with the Bayesian signal denoising problem, assuming a prior based on a sparse representation modeling over a unitary dictionary. It is well known that the maximum...
Matan Protter, Irad Yavneh, Michael Elad
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
14 years 1 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
LPNMR
2007
Springer
16 years 8 days ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele