Sciweavers

2430 search results - page 417 / 486
» Computing Tutte Polynomials
Sort
View
KAIS
2010
139views more  KAIS 2010»
15 years 1 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
101
Voted
MOR
2010
98views more  MOR 2010»
15 years 1 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
121
Voted
PVLDB
2010
97views more  PVLDB 2010»
15 years 29 days ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
111
Voted
TCOM
2010
108views more  TCOM 2010»
15 years 28 days ago
On the condition number distribution of complex wishart matrices
Abstract—This paper investigates the distribution of the condition number of complex Wishart matrices. Two closely related measures are considered: the standard condition number ...
Michail Matthaiou, Matthew R. McKay, Peter J. Smit...
115
Voted
FSTTCS
2010
Springer
15 years 17 days ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...