Sciweavers

2693 search results - page 103 / 539
» On Computing Complex Navigation Functions
Sort
View
BROADNETS
2006
IEEE
14 years 4 months ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage
CIE
2006
Springer
14 years 1 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
DCC
2006
IEEE
14 years 9 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
ECCV
2002
Springer
14 years 12 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
BMCBI
2008
163views more  BMCBI 2008»
13 years 10 months ago
Gene Ontology term overlap as a measure of gene functional similarity
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
Meeta Mistry, Paul Pavlidis