Sciweavers

702 search results - page 51 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
BMCBI
2010
99views more  BMCBI 2010»
14 years 12 months ago
Shared probe design and existing microarray reanalysis using PICKY
Background: Large genomes contain families of highly similar genes that cannot be individually identified by microarray probes. This limitation is due to thermodynamic restriction...
Hui-Hsien Chou
OOPSLA
2001
Springer
15 years 4 months ago
Points-To Analysis for Java using Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
ISQED
2000
IEEE
117views Hardware» more  ISQED 2000»
15 years 4 months ago
Realistic Worst-Case Modeling by Performance Level Principal Component Analysis
A new algorithm to determine the number and value of realistic worst-case models for the performance of module library components is presented in this paper. The proposed algorith...
Alessandra Nardi, Andrea Neviani, Carlo Guardiani
DAWAK
2010
Springer
15 years 8 hour ago
Region of Interest Based Image Categorization
Region Of Interest Based Image Classification (ROIBIC) is a mechanism for categorising images according to some specific component or object that features across a given image set....
Ashraf Elsayed, Frans Coenen, Marta García-...
TCAD
2008
195views more  TCAD 2008»
14 years 11 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...