2004 search results - page 268 / 401 » Sampling from large graphs |
144
Voted
CSB
2005
IEEE
15 years 8 months ago
2005
IEEE
The increasing availability of interaction graphs requires new resource-efficient tools capable of extracting valuable biological knowledge from these networks. In this paper we ...
IMR
2003
Springer
15 years 7 months ago
2003
Springer
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...
106
Voted
DEXA
2007
Springer
15 years 6 months ago
2007
Springer
Whenever Ajax applications on mobile devices have to retrieve large XML data fragments from a remote server, a reduction of the exchanged data volume may be crucial to manage limit...
157
Voted
IRCDL
2010
15 years 4 months ago
2010
One of the most challenging issues in managing the large and diverse data available on the World Wide Web is the design of interactive systems to organize and represent information...
135
Voted
NIPS
2007
15 years 4 months ago
2007
Semi-supervised methods use unlabeled data in addition to labeled data to construct predictors. While existing semi-supervised methods have shown some promising empirical performa...