Sciweavers

697 search results - page 33 / 140
» Approximation of Information Granule Sets
Sort
View
COCOON
2005
Springer
15 years 5 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
JCO
2006
150views more  JCO 2006»
14 years 11 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
TRANSCI
2010
128views more  TRANSCI 2010»
14 years 10 months ago
An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
Xuesong Zhou, George F. List
SSD
1995
Springer
146views Database» more  SSD 1995»
15 years 3 months ago
Discovery of Spatial Association Rules in Geographic Information Databases
Spatial data mining, i.e., discovery of interesting, implicit knowledge in spatial databases, is an important task for understanding and use of spatial data- and knowledge-bases. I...
Krzysztof Koperski, Jiawei Han
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 13 days ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran