Sciweavers

1199 search results - page 204 / 240
» Graph Theory
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
14 years 10 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
GECCO
2007
Springer
129views Optimization» more  GECCO 2007»
15 years 6 months ago
Procreating V-detectors for nonself recognition: an application to anomaly detection in power systems
The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribu...
Min Gui, Sanjoy Das, Anil Pahwa
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
15 years 5 months ago
A Formal Approach towards Assessing the Effectiveness of Anti-Spam Procedures
Spam e-mails have become a serious technological and economic problem. So far we have been reasonably able to resist spam e-mails and use the Internet for regular communication by...
Guido Schryen
PDIS
1996
IEEE
15 years 4 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
ICFP
2008
ACM
15 years 11 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy