Sciweavers

5922 search results - page 878 / 1185
» Navigability of Complex Networks
Sort
View
DAC
2003
ACM
16 years 8 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
ISBI
2006
IEEE
16 years 8 months ago
Efficient 3-D adaptive filtering for medical image enhancement
Tensor based orientation adaptive filtering, an explicit methodology for anisotropic filtering, constitutes a flexible framework for medical image enhancement. The technique featu...
Örjan Smedby, Björn Svensson, Hans Knuts...
WWW
2005
ACM
16 years 8 months ago
Boosting SVM classifiers by ensemble
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
Yan-Shi Dong, Ke-Song Han
PODC
2009
ACM
16 years 7 months ago
Brief announcement: collaborative measurement of upload speeds in P2P systems
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting