Sciweavers

2924 search results - page 405 / 585
» Lower Bounds in Distributed Computing
Sort
View
IM
2007
15 years 4 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
TCOM
2008
151views more  TCOM 2008»
15 years 4 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
JCP
2007
102views more  JCP 2007»
15 years 4 months ago
Deterministic Models of an Active Magnetic Bearing System
— In this paper the development of mathematical model of voltage-input and current-input active magnetic bearing (AMB) system in deterministic form is presented. The AMB system, ...
Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Hali...
153
Voted
CORR
2002
Springer
104views Education» more  CORR 2002»
15 years 4 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
DM
2002
95views more  DM 2002»
15 years 4 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...