The issue of confidentiality and privacy in general databases has become increasingly prominent in recent years. A key element in preserving privacy and confidentiality of sensi...
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
Modern retrieval test collections are built through a process called pooling in which only a sample of the entire document set is judged for each topic. The idea behind pooling is...
Chris Buckley, Darrin Dimmick, Ian Soboroff, Ellen...
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
With continued reductions in feature size, additional functionality may be added to future microprocessors to boost the performance of important application domains. Due to growth...