Sciweavers

1272 search results - page 35 / 255
» The Set Cover with Pairs Problem
Sort
View
JPDC
2008
161views more  JPDC 2008»
15 years 3 months ago
Base station placement on boundary of a convex polygon
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
Sasanka Roy, Debabrata Bardhan, Sandip Das
DNA
2009
Springer
185views Bioinformatics» more  DNA 2009»
15 years 10 months ago
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...
Ján Manuch, Chris Thachuk, Ladislav Stacho,...
113
Voted
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 7 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
105
Voted
IPCO
2007
77views Optimization» more  IPCO 2007»
15 years 4 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli
91
Voted
IVC
2007
82views more  IVC 2007»
15 years 3 months ago
Cloud covering denoising through image fusion
This paper presents a solution to the cloud removal problem, based in a recently developed image fusion methodology consisting in applying a 1-D pseudo-Wigner distribution (PWD) t...
Salvador Gabarda, Gabriel Cristóbal