Sciweavers

2412 search results - page 103 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 3 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
ICALP
2004
Springer
15 years 8 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson
IIS
2003
15 years 4 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
DEXAW
2009
IEEE
86views Database» more  DEXAW 2009»
15 years 10 months ago
Robust Service-Based Semantic Querying to Distributed Heterogeneous Databases
— The amount of semantic data on the Web has increased exponentially in the last years. One of the main reasons for this is the use of RDB2RDF systems, which generate RDF data fr...
Carlos Buil Aranda, Óscar Corcho, Amy Kraus...
CBMS
2005
IEEE
15 years 5 months ago
Biclustering of Expression Data Using Simulated Annealing
In gene expression data a bicluster is a subset of genes and a subset of conditions which show correlating levels of expression. However, the problem of finding significant biclu...
Kenneth Bryan, Padraig Cunningham, Nadia Bolshakov...