Sciweavers

42230 search results - page 348 / 8446
» Algorithms and Complexity Results for
Sort
View
ENDM
2008
82views more  ENDM 2008»
15 years 6 months ago
Repetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
Said Sadique Adi, Marília D. V. Braga, Cris...
CGVR
2006
15 years 8 months ago
Local Z-Buffering Rendering in Large Complex Scenes
- A novel output sensitive real-time rendering algorithm local Z-buffering for the large complex scenes is presented in this paper. A na
Xiaoxu Han
COMPGEOM
2010
ACM
15 years 12 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
AAAI
1993
15 years 8 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons
MOBIHOC
2007
ACM
16 years 6 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...