Sciweavers

2322 search results - page 118 / 465
» On a game in directed graphs
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
15 years 6 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
ER
2005
Springer
200views Database» more  ER 2005»
15 years 12 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
IAT
2009
IEEE
16 years 1 months ago
Evaluating a Drama Management Approach in an Interactive Fiction Game
— In this paper, we evaluate a drama management approach deployed in an implementation of a graphical interactive fiction game. Our approach uses players’ feedback as a basis f...
Andrea Corradini, Manish Mehta, Santi Ontañ...
MM
2010
ACM
186views Multimedia» more  MM 2010»
15 years 6 months ago
Hybrid load balancing for online games
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
Rynson W. H. Lau
TIP
2008
124views more  TIP 2008»
15 years 6 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...