Sciweavers

5592 search results - page 73 / 1119
» On Random Betweenness Constraints
Sort
View
COLING
2010
13 years 5 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
TIT
2010
61views Education» more  TIT 2010»
13 years 4 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
CORR
2012
Springer
173views Education» more  CORR 2012»
12 years 5 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge
ECAI
2004
Springer
14 years 3 months ago
Geographic Information Revision Based on Constraints
Abstract. Information usually has many sources and is often incomplete and / or uncertain, this leads to many inconsistencies. Revision is the operation which consists in identifyi...
Mahat Khelfallah, Belaid Benhamou
INFOCOM
2007
IEEE
14 years 4 months ago
Randomized Decentralized Broadcasting Algorithms
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
Laurent Massoulié, Andrew Twigg, Christos G...