Sciweavers

197 search results - page 17 / 40
» Some Topological Methods in Graph Coloring Theory
Sort
View
SENSYS
2003
ACM
14 years 1 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
ATAL
2010
Springer
13 years 9 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
INFOVIS
2005
IEEE
14 years 2 months ago
Visualization of Graphs with Associated Timeseries Data
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
Purvi Saraiya, Peter Lee, Chris North
BMCBI
2007
93views more  BMCBI 2007»
13 years 8 months ago
The topology of metabolic isotope labeling networks
Background: Metabolic Flux Analysis (MFA) based on isotope labeling experiments (ILEs) is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling ...
Michael Weitzel, Wolfgang Wiechert, Katharina N&ou...
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 2 months ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao