149 search results - page 13 / 30 » Uniform hashing in constant time and linear space |
166
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
159
click to vote
IPL
2010
15 years 4 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
159
click to vote
LATIN
2010
Springer
16 years 26 days ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
178
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
145
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...