Sciweavers

2314 search results - page 360 / 463
» Minimal Partitions of a Graph
Sort
View
152
Voted
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
15 years 7 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
92
Voted
CIC
2006
101views Communications» more  CIC 2006»
15 years 5 months ago
Non Blocking OVSF Codes Influence The Performance Of WCDMA System
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...
Shailendra Mishra, Nipur
115
Voted
CN
2006
70views more  CN 2006»
15 years 3 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
125
Voted
DM
2007
97views more  DM 2007»
15 years 3 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
134
Voted
PLDI
1990
ACM
15 years 7 months ago
A Fresh Look at Optimizing Array Bound Checking
- 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...
Rajiv Gupta