Sciweavers

6300 search results - page 317 / 1260
» We have it easy, but do we have it right
Sort
View
133
Voted
ICML
2010
IEEE
14 years 12 months ago
Comparing Clusterings in Space
This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
Michael H. Coen, M. Hidayath Ansari, Nathanael Fil...
130
Voted
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
13 years 9 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 2 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
WOLLIC
2007
Springer
15 years 8 months ago
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
Michael Moortgat
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
15 years 7 months ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen