Sciweavers

1416 search results - page 257 / 284
» The Kernel Least-Mean-Square Algorithm
Sort
View
JMM2
2007
148views more  JMM2 2007»
14 years 9 months ago
Object Segmentation Using Background Modelling and Cascaded Change Detection
— The automatic extraction and analysis of visual information is becoming generalised. The first step in this processing chain is usually separating or segmenting the captured v...
Luís Filipe Teixeira, Jaime S. Cardoso, Lu&...
VLSISP
2008
129views more  VLSISP 2008»
14 years 9 months ago
Architecture and Evaluation of an Asynchronous Array of Simple Processors
Abstract-- This paper presents the architecture of an Asynchronous Array of simple Processors (AsAP), and evaluates its key architectural features as well as its performance and en...
Zhiyi Yu, Michael J. Meeuwsen, Ryan W. Apperson, O...
CN
2002
124views more  CN 2002»
14 years 9 months ago
TCP HACK: a mechanism to improve performance over lossy links
In recent years, wireless networks have become increasingly common and an increasing number of devices are communicating with each other over lossy links. Unfortunately, TCP perfo...
Rajesh Krishna Balan, Boon Peng Lee, K. R. Renjish...
SIGMETRICS
2002
ACM
117views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Context-aware TCP/IP
Abstract-This paper discusses the design and evaluation of CATNIP, a ContextAware Transport/Network Internet Protocol for the Web. This integrated protocol uses application-layer k...
Carey L. Williamson, Qian Wu
DAM
2008
140views more  DAM 2008»
14 years 9 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo