Sciweavers

2826 search results - page 40 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
AINA
2009
IEEE
14 years 3 months ago
Improving Opportunistic Data Dissemination via Known Vector
An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task an...
Jyh-How Huang, Ying-Yu Chen, Yi-Chao Chen, Shivaka...
VC
2008
88views more  VC 2008»
13 years 9 months ago
Evolution of T-spline level sets for meshing non-uniformly sampled and incomplete data
Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may ...
Huaiping Yang, Bert Jüttler
ICML
2004
IEEE
14 years 10 months ago
Learning Bayesian network classifiers by maximizing conditional likelihood
Bayesian networks are a powerful probabilistic representation, and their use for classification has received considerable attention. However, they tend to perform poorly when lear...
Daniel Grossman, Pedro Domingos
DNA
2004
Springer
157views Bioinformatics» more  DNA 2004»
14 years 2 months ago
Bond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
Lila Kari, Stavros Konstantinidis, Petr Sosí...
ATS
1998
IEEE
76views Hardware» more  ATS 1998»
14 years 1 months ago
Partitioning and Reordering Techniques for Static Test Sequence Compaction of Sequential Circuits
We propose a new static test set compaction method based on a careful examination of attributes of fault coverage curves. Our method is based on two key ideas: 1 fault-list and te...
Michael S. Hsiao, Srimat T. Chakradhar