Sciweavers

94 search results - page 18 / 19
» A study of the total chromatic number of equibipartite graph...
Sort
View
SIROCCO
2010
13 years 9 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
CIKM
2006
Springer
13 years 11 months ago
Eigen-trend: trend analysis in the blogosphere based on singular value decompositions
The blogosphere--the totality of blog-related Web sites-has become a great source of trend analysis in areas such as product survey, customer relationship, and marketing. Existing...
Yun Chi, Belle L. Tseng, Jun'ichi Tatemura
SPAA
1999
ACM
13 years 12 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 7 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
WISEC
2009
ACM
14 years 2 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...