Sciweavers

1883 search results - page 266 / 377
» Ordered theta graphs
Sort
View
AAAI
2006
13 years 11 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
ACSW
2006
13 years 11 months ago
Description of bad-signatures for network intrusion detection
Today, a computer network is under constant assault from attacks. In Computer Science, NIDS are used in order to protect a computer network against these intrusions. These systems...
Michael Hilker, Christoph Schommer
IJCAI
2003
13 years 11 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
ACL
1998
13 years 11 months ago
Terminological Variation, a Means of Identifying Research Topics from Texts
After extracting terms from a corpus of titles and s in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of synta...
Fidelia Ibekwe-Sanjuan
SPLST
2003
13 years 11 months ago
How to Draw a Sequence Diagram
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa