Sciweavers

13 search results - page 2 / 3
» Inherently nonfinitely based lattices
Sort
View
TAPOS
1998
126views more  TAPOS 1998»
13 years 7 months ago
Design of Class Hierarchies Based on Concept (Galois) Lattices
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
Robert Godin, Hafedh Mili, Guy W. Mineau, Rokia Mi...
CVPR
2001
IEEE
14 years 9 months ago
Temporal Integration of Multiple Silhouette-Based Body-Part Hypotheses
A method for temporally integrating appearance-based body-part labelling is presented. We begin by modifying the silhouette labelling method of Ghost[4]; that system first determi...
Vivek Kwatra, Aaron F. Bobick, Amos Y. Johnson
CORR
2006
Springer
156views Education» more  CORR 2006»
13 years 7 months ago
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
Ying Hung Gan, Cong Ling, Wai Ho Mow
EDBT
2009
ACM
106views Database» more  EDBT 2009»
13 years 11 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen