Results 51 to 60 of about 11,243,181 (388)

Marching cubes: A high resolution 3D surface construction algorithm

open access: yesInternational Conference on Computer Graphics and Interactive Techniques, 1987
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice connectivity, we create a case table that defines triangle ...
W. Lorensen, H. Cline
semanticscholar   +1 more source

Approximation algorithms [PDF]

open access: yesProceedings of the National Academy of Sciences, 1997
Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 10 6
Schulz, Andreas S.   +2 more
openaire   +4 more sources

Weed Identification Using Deep Learning and Image Processing in Vegetable Plantation

open access: yesIEEE Access, 2021
Weed identification in vegetable plantation is more challenging than crop weed identification due to their random plant spacing. So far, little work has been found on identifying weeds in vegetable plantation.
Xiaojun Jin, Jun Che, Yong Chen
doaj   +1 more source

A training algorithm for optimal margin classifiers

open access: yesAnnual Conference Computational Learning Theory, 1992
A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis ...
B. Boser, Isabelle M Guyon, V. Vapnik
semanticscholar   +1 more source

An algorithm for the T-countAn algorithm for the T-count

open access: yesQuantum Information and Computation, 2014
We consider quantum circuits composed of Clifford and $T$ gates. In this context the $T$ gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly.
Michele Mosca   +3 more
openaire   +3 more sources

Optimal SNP filtering strategies for pedigree reconstruction: A case study with wild red‐spotted masu salmon population

open access: yesPopulation Ecology, EarlyView.
In this article, we tested optimal SNP filtering strategies for accurate parentage assignment and pedigree reconstruction for a wild population of red‐spotted masu salmon, Oncorhynchus masou ishikawae. We found that mid‐point filtering in terms of call rate and minor allele frequency performs well for pedigree reconstruction.
Shohei Noda   +6 more
wiley   +1 more source

Data-Driven Clustering Analysis for Representative Electric Vehicle Charging Profile in South Korea

open access: yesSensors
As the penetration of electric vehicles (EVs) increases, an understanding of EV operation characteristics becomes crucial in various aspects, e.g., grid stability and battery degradation.
Kangsan Kim   +6 more
doaj   +1 more source

An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High Dimensional Sparse Data [PDF]

open access: yes, 1999
Chow and Liu introduced an algorithm for fitting a multivariate distribution with a tree (i.e. a density model that assumes that there are only pairwise dependencies between variables) and that the graph of these dependencies is a spanning tree.
An Accelerated Chow   +2 more
core   +2 more sources

The anti-$k_t$ jet clustering algorithm [PDF]

open access: yes, 2008
The k_t and Cambridge/Aachen inclusive jet finding algorithms for hadron-hadron collisions can be seen as belonging to a broader class of sequential recombination jet algorithms, parametrised by the power of the energy scale in the distance measure.
M. Cacciari, G. Salam, G. Soyez
semanticscholar   +1 more source

Fast algorithm for detecting community structure in networks. [PDF]

open access: yesPhysical review. E, Statistical, nonlinear, and soft matter physics, 2003
Many networks display community structure--groups of vertices within which connections are dense but between which they are sparser--and sensitive computer algorithms have in recent years been developed for detecting this structure.
M. Newman
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy