Sciweavers

2958 search results - page 425 / 592
» Extending and Implementing RASP
Sort
View
125
Voted
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
15 years 8 months ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...
RECOMB
1998
Springer
15 years 8 months ago
Alignments without low-scoring regions
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
Zheng Zhang 0004, Piotr Berman, Webb Miller
130
Voted
INFOVIS
1997
IEEE
15 years 8 months ago
Domesticating Bead: adapting an information visualization system to a financial institution
The Bead visualization system employs a fast algorithm for laying out high-dimensional data in a low-dimensional space, and a number of features added to 3D visualizations to impr...
Dominique Brodbeck, Matthew Chalmers, Aran Lunzer,...
145
Voted
WER
1998
Springer
15 years 8 months ago
Towards Requirements Engineering of Active Database Systems
Active systems are emerging in many fields, being particularly interesting those like Active Database Management Systems which always provide some kind of reactive capabilities. I...
José Hilario Canós Cerdá, Jav...
184
Voted
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
15 years 8 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang