Sciweavers

941 search results - page 70 / 189
» Efficient Testing of Large Graphs
Sort
View
ESOP
2010
Springer
15 years 7 months ago
Separating Shape Graphs
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
Vincent Laviron, Bor-Yuh Evan Chang and Xavier Riv...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 2 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
ICIS
2001
14 years 11 months ago
Transaction Costs and Market Efficiency
Previous research suggests that a decline in transactions costs leads to improved economic efficiency. In this paper,weshowthatsuchadeclinewillintroduceincreasinglyuninformedconsu...
Bin Gu, Lorin M. Hitt
BCB
2010
166views Bioinformatics» more  BCB 2010»
14 years 4 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...
ICPR
2000
IEEE
15 years 11 months ago
The Multimodal Signature Method: An Efficiency and Sensitivity Study
The multimodal neighbourhood signature (MNS) method has given acceptable results both for the colour-based image retrieval and the object recognition task. Local colour content is...
Dimitri Koubaroulis, Jiri Matas, Josef Kittler