1594 search results - page 134 / 319 » An Algorithm to Compute Collusion Paths |
137
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
120
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
116
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
108
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— A control-plane architecture for supporting advance reservation of dedicated bandwidth channels on a switched network infrastructure is described including the front-end web in...
129
click to vote
DAC
1994
ACM
15 years 7 months ago
1994
ACM
- This paper analyzes the effect of resource sharing and assignment on the clock period of the synthesized circuit. We focus on behavioral specifications with mutually exclusive pa...