Sciweavers

1093 search results - page 94 / 219
» Clustering from Constraint Graphs
Sort
View
141
Voted
NETGAMES
2006
ACM
15 years 9 months ago
Peer clustering: a hybrid approach to distributed virtual environments
This paper proposes a hybrid architecture for distributed virtual environments, utilizing servers alongside peer-to-peer components. Current research into peer-based systems seeks...
Alvin Chen, Richard R. Muntz
139
Voted
JMLR
2010
175views more  JMLR 2010»
14 years 10 months ago
Hierarchical Convex NMF for Clustering Massive Data
We present an extension of convex-hull non-negative matrix factorization (CH-NMF) which was recently proposed as a large scale variant of convex non-negative matrix factorization ...
Kristian Kersting, Mirwaes Wahabzada, Christian Th...
ATAL
2005
Springer
15 years 9 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
142
Voted
SPAA
2000
ACM
15 years 7 months ago
Fault tolerant networks with small degree
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
Li Zhang
134
Voted
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
16 years 11 days ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...