Sciweavers

14518 search results - page 389 / 2904
» Two Problems for Sophistication
Sort
View
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
15 years 10 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
ICALP
2009
Springer
16 years 7 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
CEAS
2005
Springer
16 years 10 days ago
Combating Spam through Legislation: A Comparative Analysis of US and European Approaches
Unsolicited Commercial Communication also known as spam - has traditionally been the most visible e-mail threat and has reached a point where it creates a major problem for the de...
Evangelos Moustakas, C. Ranganathan, Penny Duqueno...
PASTE
2004
ACM
16 years 7 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
POPL
2000
ACM
15 years 11 months ago
Authentication Primitives and Their Compilation
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
Martín Abadi, Cédric Fournet, George...