Sciweavers

697 search results - page 78 / 140
» Decomposition Structures for Event-B
Sort
View
CCE
2004
14 years 11 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
SCHOLARPEDIA
2008
109views more  SCHOLARPEDIA 2008»
14 years 11 months ago
Latent semantic analysis
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (&q...
Thomas K. Landauer, Susan T. Dumais
SIAMSC
2008
113views more  SIAMSC 2008»
14 years 11 months ago
Statistical Condition Estimation for the Roots of Polynomials
This paper presents fast and reliable condition estimates for the roots of a real polynomial based on the method of statistical condition estimation (SCE) by Kenney and Laub. Using...
A. J. Laub, J. Xia
ICDE
2009
IEEE
153views Database» more  ICDE 2009»
16 years 1 months ago
Efficient Distribution of Full-Fledged XQuery
Abstract-- We investigate techniques to automatically decompose any XQuery query into subqueries, that can be executed near their data sources; i.e., function-shipping. In this sce...
Ying Zhang, Nan Tang, Peter A. Boncz
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
15 years 6 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir