Sciweavers

4114 search results - page 407 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
3DPVT
2004
IEEE
131views Visualization» more  3DPVT 2004»
15 years 10 months ago
Neural Mesh Ensembles
This paper proposes the use of neural network ensembles to boost the performance of a neural network based surface reconstruction algorithm. Ensemble is a very popular and powerfu...
Ioannis P. Ivrissimtzis, Yunjin Lee, Seungyong Lee...
CGI
2004
IEEE
15 years 10 months ago
Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes
Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering&...
Takehiro Tawara, Karol Myszkowski, Hans-Peter Seid...
ICAART
2010
INSTICC
16 years 3 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
16 years 9 days ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
WEBI
2005
Springer
16 years 9 days ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal