Sciweavers

14121 search results - page 278 / 2825
» Interval Computations in Computer Vision
Sort
View
SAC
2006
ACM
16 years 16 days ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
IPPS
2003
IEEE
15 years 12 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
JGTOOLS
2007
144views more  JGTOOLS 2007»
15 years 6 months ago
Faster Relief Mapping using the Secant Method
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
Eric Risser, Musawir Shah, Sumanta N. Pattanaik
SCHEDULING
2010
137views more  SCHEDULING 2010»
15 years 5 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...
RECOMB
2009
Springer
16 years 7 months ago
A Robust Bayesian Two-Sample Test for Detecting Intervals of Differential Gene Expression in Microarray Time Series
Abstract. Understanding the regulatory mechanisms that are responsible for an organism's response to environmental changes is an important question in molecular biology. A fir...
Oliver Stegle, Katherine J. Denby, David L. Wild, ...