Sciweavers

3146 search results - page 94 / 630
» Efficient Consequence Finding
Sort
View
TON
2002
86views more  TON 2002»
13 years 9 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 11 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
CIBCB
2006
IEEE
14 years 4 months ago
Iris Recognition Algorithm Optimized for Hardware Implementation
: Iris recognition is accepted as one of the most efficient biometric method. Implementing this method to the practical system requires the special image preprocessing where the ir...
Kamil Grabowski, Wojciech Sankowski, Malgorzata Na...
WALCOM
2008
IEEE
82views Algorithms» more  WALCOM 2008»
13 years 11 months ago
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
Henning Fernau, Daniel Raible
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 10 months ago
Polynomial-time algorithms for coding across multiple unicasts
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Tracey Ho