3068 search results - page 561 / 614 » Clustering with Multiple Graphs |
144
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
142
click to vote
COCO
2000
Springer
15 years 8 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
149
click to vote
SIGADA
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
135
click to vote
PLDI
1990
ACM
15 years 8 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
151
Voted
DIALM
2007
ACM
15 years 7 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...