Sciweavers

917 search results - page 151 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
FUIN
2011
358views Cryptology» more  FUIN 2011»
14 years 1 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
TPHOL
2007
IEEE
15 years 3 months ago
Using XCAP to Certify Realistic Systems Code: Machine Context Management
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
Zhaozhong Ni, Dachuan Yu, Zhong Shao
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 1 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
BIRTHDAY
2010
Springer
14 years 8 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein
VIS
2004
IEEE
138views Visualization» more  VIS 2004»
15 years 11 months ago
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation
We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cel...
Nan Zhang 0011, Wei Hong, Arie E. Kaufman