Sciweavers

3134 search results - page 37 / 627
» Computing full disjunctions
Sort
View
POPL
2009
ACM
14 years 10 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
AI
2010
Springer
14 years 2 months ago
Overlap versus Imbalance
Abstract. In this paper we give a systematic analysis of the relationship between imbalance and overlap as factors influencing classifier performance. We demonstrate that these t...
Misha Denil, Thomas P. Trappenberg
FTP
1998
Springer
14 years 2 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt
MEDINFO
2007
124views Healthcare» more  MEDINFO 2007»
13 years 11 months ago
Experiments with Hierarchical Concept-Based Search
Many digital libraries use hierarchical indexing schema, such as MeSH to enable concept based search in the retrieval phase. However, improving or outperforming the traditional fu...
Robert Moskovitch, Roee Sa'adon, Eytan Behiri, Sus...
ANOR
2005
131views more  ANOR 2005»
13 years 9 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas