Sciweavers

4325 search results - page 830 / 865
» Incremental computation with names
Sort
View
70
Voted
DATE
2010
IEEE
157views Hardware» more  DATE 2010»
15 years 4 months ago
RMOT: Recursion in model order for task execution time estimation in a software pipeline
Abstract—This paper addresses the problem of execution time estimation for tasks in a software pipeline independent of the application structure or the underlying architecture. A...
Nabeel Iqbal, M. A. Siddique, Jörg Henkel
ECBS
2002
IEEE
114views Hardware» more  ECBS 2002»
15 years 3 months ago
An Intelligent Agent Security Intrusion System
Network security has now become one of the most important aspects in computer systems and the Internet. Apart from strong encryption, there is no definite method of truly securing...
J. Pikoulas, William J. Buchanan, Mike Mannion, K....
81
Voted
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
15 years 3 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
SIGMETRICS
2010
ACM
173views Hardware» more  SIGMETRICS 2010»
15 years 3 months ago
Channel fragmentation in dynamic spectrum access systems: a theoretical study
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
83
Voted
ICALP
2010
Springer
15 years 3 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket