1201 search results - page 104 / 241 » Exact Analysis of Exact Change |
VIIP
2001
13 years 10 months ago
2001
Large and complex information requires arbitrarily extensive displays for an exact, comprehensive visualization. This paper introduces a technique, time-multiplexing, for presenti...
USS
2004
13 years 10 months ago
2004
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
ICPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
DM
2008
13 years 9 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...