Sciweavers

1594 search results - page 256 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
RECOMB
2004
Springer
16 years 3 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
BROADNETS
2007
IEEE
15 years 9 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
IMC
2007
ACM
15 years 4 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
CGA
1998
15 years 2 months ago
Composite Lighting Simulations with Lighting Networks
A whole variety of different techniques for simulating global illumination in virtual environments have been developed over recent years. Each technique, including Radiosity, Mont...
Philipp Slusallek, Marc Stamminger, Wolfgang Heidr...
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 9 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...