Sciweavers

4934 search results - page 876 / 987
» complexity 2008
Sort
View
CSDA
2008
128views more  CSDA 2008»
15 years 4 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
DAM
2008
129views more  DAM 2008»
15 years 4 months ago
Minimum cost homomorphisms to semicomplete multipartite digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
Gregory Gutin, Arash Rafiey, Anders Yeo
DCG
2008
118views more  DCG 2008»
15 years 4 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
ENGL
2008
186views more  ENGL 2008»
15 years 4 months ago
High Performance Monte-Carlo Based Option Pricing on FPGAs
High performance computing is becoming increasingly important in the field of financial computing, as the complexity of financial models continues to increase. Many of these financ...
Xiang Tian, Khaled Benkrid, Xiaochen Gu
ENTCS
2008
106views more  ENTCS 2008»
15 years 4 months ago
Modelling Adaptive Systems in ForSyDe
Emerging architectures such as partially reconfigurable FPGAs provide a huge potential for adaptivity in the area of embedded systems. Since many system functions are only execute...
Ingo Sander, Axel Jantsch