Sciweavers

1712 search results - page 314 / 343
» A Computational Approach to Binding Theory
Sort
View
SPAA
2005
ACM
15 years 7 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
ASAP
2003
IEEE
133views Hardware» more  ASAP 2003»
15 years 6 months ago
Storage Management in Process Networks using the Lexicographically Maximal Preimage
At the Leiden Embedded Research Center, we are developing a compiler called Compaan that automatically translates signal processing applications written in Matlab into Kahn Proces...
Alexandru Turjan, Bart Kienhuis
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
CIKM
1997
Springer
15 years 5 months ago
Analysis and Design of Server Informative WWW-Sites
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza ...
SPIEVIP
2010
15 years 3 months ago
Automatic scene activity modeling for improving object classification
In video surveillance, automatic methods for scene understanding and activity modeling can exploit the high redundancy of object trajectories observed over a long period of time. ...
Samuel Foucher, Marc Lalonde, Langis Gagnon