Sciweavers

54 search results - page 2 / 11
» Constructing an optimal server set in structured peer-to-pee...
Sort
View
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
13 years 11 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 6 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
IJAR
2010
130views more  IJAR 2010»
13 years 3 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 2 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall
QSIC
2005
IEEE
13 years 10 months ago
A System to Mark Programs Automatically
This paper describes a system to automatically mark student programs. It is a real time examination system that provides an environment for the compilation and execution of softwa...
Ken Ngo-Pham, John Bigham, Julian Rodaway, Lauriss...