Sciweavers

47 search results - page 4 / 10
» Exact and Approximation Algorithms for DNA Tag Set Design
Sort
View
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
13 years 10 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
IPPS
2002
IEEE
13 years 10 months ago
Parallel EST Clustering
Expressed sequence tags, abbreviated ESTs, are DNA fragments experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and unde...
Anantharaman Kalyanaraman, Srinivas Aluru, Suresh ...
CAD
2008
Springer
13 years 5 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 6 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 2 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...