Sciweavers

845 search results - page 91 / 169
» Connecting Many-Sorted Theories
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 6 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
LATA
2010
Springer
16 years 3 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
FOCS
2006
IEEE
16 years 7 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
INFOCOM
2005
IEEE
15 years 11 months ago
Monotone percolation and the topology control of wireless networks
— This paper addresses the topology control problem for large wireless networks that are modelled by an infinite point process on a two-dimensional plane. Topology control is th...
Anxiao Jiang, Jehoshua Bruck
LICS
2005
IEEE
15 years 11 months ago
Modal Characterisation Theorems over Special Classes of Frames
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem...
Anuj Dawar, Martin Otto