Sciweavers

4926 search results - page 240 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
AGTIVE
2003
Springer
15 years 11 months ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....
BMCBI
2010
146views more  BMCBI 2010»
15 years 6 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 5 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb