Sciweavers

194 search results - page 19 / 39
» The Parameterized Complexity of Some Minimum Label Problems
Sort
View
87
Voted
ECOOP
2006
Springer
15 years 4 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
137
Voted
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 4 days ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
86
Voted
WG
2005
Springer
15 years 6 months ago
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
Guillaume Blin, Guillaume Fertin, Danny Hermelin, ...
112
Voted
JAIR
2000
105views more  JAIR 2000»
15 years 8 days ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
119
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra