Sciweavers

339 search results - page 44 / 68
» Handling dynamic data structures in search based testing
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 1 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
PVLDB
2008
101views more  PVLDB 2008»
13 years 8 months ago
Multidimensional content eXploration
Content Management Systems (CMS) store enterprise data such as insurance claims, insurance policies, legal documents, patent applications, or archival data like in the case of dig...
Alkis Simitsis, Akanksha Baid, Yannis Sismanis, Be...
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
14 years 3 months ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
Dario Bonino, Fulvio Corno
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
14 years 2 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
BMCBI
2008
117views more  BMCBI 2008»
13 years 9 months ago
A probabilistic framework to predict protein function from interaction data integrated with semantic knowledge
Background: The functional characterization of newly discovered proteins has been a challenge in the post-genomic era. Protein-protein interactions provide insights into the funct...
Young-Rae Cho, Lei Shi, Murali Ramanathan, Aidong ...