Sciweavers

3471 search results - page 464 / 695
» Obstacle Numbers of Graphs
Sort
View
CISS
2008
IEEE
15 years 6 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
15 years 6 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
AI
2006
Springer
15 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
135
Voted
CORR
2007
Springer
96views Education» more  CORR 2007»
15 years 6 months ago
Understanding the Properties of the BitTorrent Overlay
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
Anwar Al Hamra, Arnaud Legout, Chadi Barakat
ORDER
2008
61views more  ORDER 2008»
15 years 6 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel