Sciweavers

304 search results - page 43 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 25 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
BMCBI
2005
156views more  BMCBI 2005»
13 years 8 months ago
DynGO: a tool for visualizing and mining of Gene Ontology and its associations
Background: A large volume of data and information about genes and gene products has been stored in various molecular biology databases. A major challenge for knowledge discovery ...
Hongfang Liu, Zhang-Zhi Hu, Cathy H. Wu
INFSOF
2011
176views more  INFSOF 2011»
13 years 3 months ago
Testing in Service Oriented Architectures with dynamic binding: A mapping study
Context: Service Oriented Architectures (SOA) have emerged as a new paradigm to develop interoperable and highly dynamic applications. Objective: This paper aims to identify the s...
Marcos Palacios, José García-Fanjul,...
ISMIS
1999
Springer
14 years 26 days ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen

Lecture Notes
443views
15 years 6 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount