2498 search results - page 396 / 500 » Data Structures with Unpredictable Timing |
141
click to vote
IPOM
2007
Springer
15 years 11 months ago
2007
Springer
It is by now widely accepted that the arrival process of aggregate network traffic exhibits self-similar characteristics which result in the preservation of traffic burstiness (hig...
151
click to vote
SEMWEB
2007
Springer
15 years 11 months ago
2007
Springer
In collaborative indexing systems users generate a big amount of metadata by labelling web-based content. These labels are known as tags and form a shared vocabulary. In order to u...
138
Voted
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
165
Voted
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
153
click to vote
ASUNAM
2010
IEEE
15 years 5 months ago
2010
IEEE
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...