Sciweavers

63 search results - page 7 / 13
» On Extending the Complex FastICA Algorithm to Noncircular So...
Sort
View
TOG
2008
139views more  TOG 2008»
13 years 7 months ago
Logarithmic perspective shadow maps
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
Brandon Lloyd, Naga K. Govindaraju, Cory Quammen, ...
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
CIKM
2010
Springer
13 years 5 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
COMCOM
2006
75views more  COMCOM 2006»
13 years 7 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
SEMCO
2007
IEEE
14 years 1 months ago
Determining Modality and Factuality for Text Entailment
Recognizing textual entailment (TE) is a complex task involving knowledge from many different sources. One major source of information in this task is event factuality, since the ...
Roser Sauri, James Pustejovsky