Sciweavers

714 search results - page 105 / 143
» An efficient algorithm for positive realizations
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 2 days ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 6 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor
GLOBECOM
2010
IEEE
14 years 9 months ago
On Comparing the Performance of Dynamic Multi-Network Optimizations
With a large variety of wireless access technologies available, multi-homed devices may strongly improve the performance and reliability of communication when using multiple networ...
Geert Jan Hoekstra, Robert D. van der Mei, J. W. B...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 4 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
VMV
2004
185views Visualization» more  VMV 2004»
15 years 1 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...