Sciweavers

1480 search results - page 82 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
IJCNN
2007
IEEE
14 years 4 months ago
Probability Density Function Estimation Using Orthogonal Forward Regression
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...
Sheng Chen, Xia Hong, Chris J. Harris
RECOMB
2004
Springer
14 years 10 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
ICDCS
2005
IEEE
14 years 4 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer
CCR
2004
110views more  CCR 2004»
13 years 10 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
IJCAI
2003
13 years 11 months ago
Continuous nonlinear dimensionality reduction by kernel Eigenmaps
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
Matthew Brand