Sciweavers

958 search results - page 181 / 192
» The Time Index: An Access Structure for Temporal Data
Sort
View
QUESTA
2006
94views more  QUESTA 2006»
13 years 7 months ago
Modeling teletraffic arrivals by a Poisson cluster process
In this paper we consider a Poisson cluster process N as a generating process for the arrivals of packets to a server. This process generalizes in a more realistic way the infinite...
Gilles Faÿ, Bárbara González-Ar...
WSDM
2009
ACM
158views Data Mining» more  WSDM 2009»
14 years 2 months ago
A new visual search interface for web browsing
We introduce a new visual search interface for search engines. The interface is a user-friendly and informative graphical front-end for organizing and presenting search results in...
Songhua Xu, Tao Jin, Francis Chi-Moon Lau
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
BTW
2007
Springer
183views Database» more  BTW 2007»
13 years 11 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
SAC
2006
ACM
14 years 1 months ago
Operating system multilevel load balancing
This paper describes an algorithm that allows Linux to perform multilevel load balancing in NUMA computers. The Linux scheduler implements a load balancing algorithm that uses str...
Mônica Corrêa, Avelino Francisco Zorzo...