Sciweavers

5922 search results - page 132 / 1185
» Navigability of Complex Networks
Sort
View
NIPS
2007
15 years 2 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
PRESENCE
2002
119views more  PRESENCE 2002»
15 years 13 days ago
Visual Homing Is Possible Without Landmarks: A Path Integration Study in Virtual Reality
The literature often suggests that proprioceptive and especially vestibular cues are required for navigation and spatial orientation tasks involving rotations of the observer. To ...
Bernhard E. Riecke, Henricus A. H. C. van Veen, He...
110
Voted
ICCD
2003
IEEE
111views Hardware» more  ICCD 2003»
15 years 9 months ago
Reducing Operand Transport Complexity of Superscalar Processors using Distributed Register Files
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
Santithorn Bunchua, D. Scott Wills, Linda M. Wills
STACS
2001
Springer
15 years 5 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
110
Voted
COCOON
2008
Springer
15 years 2 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang