Sciweavers

5055 search results - page 765 / 1011
» Relative Timing
Sort
View
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 6 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
CG
1998
Springer
15 years 6 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra
CSL
1998
Springer
15 years 6 months ago
Evaluating spoken dialogue agents with PARADISE: Two case studies
This paper presents PARADISE PARAdigm for DIalogue System Evaluation, a general framework for evaluating and comparing the performance of spoken dialogue agents. The framework d...
Marilyn A. Walker, Diane J. Litman, Candace A. Kam...
INFORMATICALT
2002
116views more  INFORMATICALT 2002»
15 years 6 months ago
On the Optimization of an Adaptive State Estimation of Dynamic Systems in the Presence of Time-varying Outliers
The problem of recursive estimation of a state of dynamic systems in the presence of time-varying outliers in observations to be processed has been considered. A learning phase use...
Rimantas Pupeikis
CGF
1999
125views more  CGF 1999»
15 years 6 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...