Sciweavers

1224 search results - page 163 / 245
» Theory decision by decomposition
Sort
View
114
Voted
SPAA
2006
ACM
15 years 6 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 5 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
CIKM
2008
Springer
15 years 2 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
DCG
2006
163views more  DCG 2006»
15 years 23 days ago
Isometry-Invariant Valuations on Hyperbolic Space
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
Daniel A. Klain
105
Voted
IMCS
2007
144views more  IMCS 2007»
15 years 19 days ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova