Sciweavers

318 search results - page 63 / 64
» Decomposition of Domains
Sort
View
IJCAI
1989
13 years 6 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 6 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
BMCBI
2008
112views more  BMCBI 2008»
13 years 5 months ago
A simplified approach to disulfide connectivity prediction from protein sequences
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
Marc Vincent, Andrea Passerini, Matthieu Labb&eacu...
CG
2007
Springer
13 years 5 months ago
Visual data mining and analysis of software repositories
In this article we describe an ongoing effort to integrate information visualization techniques into the process of configuration management for software systems. Our focus is to...
Lucian Voinea, Alexandru Telea
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 5 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...