Sciweavers

339 search results - page 42 / 68
» Handling dynamic data structures in search based testing
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
SAC
2011
ACM
12 years 12 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
EUMAS
2006
13 years 10 months ago
A Customizable Multi-Agent System for Distributed Data Mining
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
Giancarlo Fortino, Giuseppe Di Fatta
BIOINFORMATICS
2007
195views more  BIOINFORMATICS 2007»
13 years 9 months ago
Context-dependent clustering for dynamic cellular state modeling of microarray gene expression
Motivation: High-throughput expression profiling allows researchers to study gene activities globally. Genes with similar expression profiles are likely to encode proteins that ma...
Shinsheng Yuan, Ker-Chau Li
TVLSI
2008
139views more  TVLSI 2008»
13 years 9 months ago
Ternary CAM Power and Delay Model: Extensions and Uses
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
Banit Agrawal, Timothy Sherwood