Sciweavers

1998 search results - page 155 / 400
» Complexity of the Cover Polynomial
Sort
View
TOG
2010
111views more  TOG 2010»
15 years 1 months ago
Detail-preserving fully-Eulerian interface tracking framework
This paper introduces a fully-Eulerian interface tracking framework that preserves the fine details of liquids. Unlike existing Eulerian methods, the proposed framework shows good...
Nambin Heo, Hyeong-Seok Ko

Publication
222views
16 years 3 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
ICIP
1998
IEEE
16 years 8 months ago
Blind Estimation of PSF for Out of Focus Video Data
A method has beenproposed for blindly estimating the Point Spread Function (PSF) of video data. The PSF's of the images in a sequence are assumed to be of compact support and...
Hassan Shekarforoush, Rama Chellappa
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
16 years 20 days ago
Distance Coloring
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
Alexa Sharp
LACL
2005
Springer
15 years 12 months ago
Linguistic Facts as Predicates over Ranges of the Sentence
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
Benoît Sagot