Sciweavers

1379 search results - page 169 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
ICDM
2008
IEEE
123views Data Mining» more  ICDM 2008»
16 years 26 days ago
Mining Periodic Behavior in Dynamic Social Networks
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...
Mayank Lahiri, Tanya Y. Berger-Wolf
ICPR
2008
IEEE
16 years 26 days ago
Graph cut based deformable model with statistical shape priors
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
Noha Youssry El-Zehiry, Adel Elmaghraby
PIMRC
2008
IEEE
16 years 24 days ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
ICC
2007
IEEE
16 years 22 days ago
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
Edwin Soedarmadji, Robert J. McEliece
INFOCOM
2007
IEEE
16 years 22 days ago
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
Changhee Joo, Ness B. Shroff