Sciweavers

7006 search results - page 1071 / 1402
» Approximation Algorithms
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
16 years 1 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
IPPS
2003
IEEE
15 years 12 months ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
141
Voted
GCB
1998
Springer
78views Biometrics» more  GCB 1998»
15 years 11 months ago
Computational approaches to identify Leucine Zippers
The leucine zipper is a dimerization domain occurring mostly in regulatory and thus in many oncogenic proteins. The leucine repeat in the sequence has been traditionally used for ...
Erich Bornberg-Bauer
CIKM
2009
Springer
15 years 10 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
« Prev « First page 1071 / 1402 Last » Next »