Sciweavers

1729 search results - page 152 / 346
» Deterministic Expressions in C
Sort
View
DLOG
2001
15 years 5 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
CCS
2006
ACM
15 years 8 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
NETWORKS
2008
15 years 4 months ago
Grooming for two-period optical networks
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
16 years 4 months ago
Matching Large XML Schemas
Current schema matching approaches still have to improve for very large and complex schemas. Such schemas are increasingly written in the standard language W3C XML schema, especia...
Erhard Rahm, Hong Hai Do, Sabine Massmann
ICIP
2008
IEEE
15 years 11 months ago
Microarray image gridding via an evolutionary algorithm
Gridding is the first, essential stage of processing cDNA microarray images. The existing tools for allocating the grid structure in a microarray image often require human interve...
Eleni Zacharia, Dimitris Maroulis