Sciweavers

1951 search results - page 289 / 391
» An algorithm for improving graph partitions
Sort
View
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
15 years 8 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 5 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
ICCV
2009
IEEE
16 years 9 months ago
Scene Shape Priors for Superpixel Segmentation
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for feat...
Alastair P. Moore, Simon J. D. Prince, Jonathan Wa...
BIBE
2007
IEEE
108views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
On the Design of Oligos for Gene Synthesis
— Methods for reliable synthesis of long genes offer great promise for protein synthesis via expression of synthetic genes, with applications to improved analysis of protein stru...
Chris Thachuk, Anne Condon
CLUSTER
2005
IEEE
15 years 10 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster