Sciweavers

11321 search results - page 327 / 2265
» Improvements to Turing's method
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 12 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
EDOC
2002
IEEE
15 years 11 months ago
Model-Based Risk Assessment to Improve Enterprise Security
The main objective of the CORAS project is to provide methods and tools for precise, unambiguous, and efficient risk assessment of security critical systems. To this end, we advoc...
Jan Øyvind Aagedal, Folker den Braber, Theo...
IPPS
2002
IEEE
15 years 11 months ago
Improving Performance of Multiple Sequence Alignment Analysis in Multi-Client Environments
This paper is concerned with the efficient execution of multiplesequence alignmentmethodsin a multipleclientenvironment. Multiple sequence alignment (MSA) is a computationally ex...
Ümit V. Çatalyürek, Eric Stahlber...
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
15 years 11 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
Volker Markl, Frank Ramsak, Rudolf Bayer
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 11 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos