Sciweavers

70 search results - page 13 / 14
» Improved Algorithms for Partial Curve Matching
Sort
View
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 5 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
IJCAI
2003
13 years 6 months ago
A Method for Semantically Enhancing the Service Discovery Capabilities of UDDI
The promise of dynamic selection of business services and automatic integration of applications written to Web Services standards is yet to be realized. This is partially attribut...
Rama Akkiraju, Richard Goodwin, Prashant Doshi, Sa...
TREC
2001
13 years 6 months ago
Link-based Approaches for Text Retrieval
We assess a family of ranking mechanisms for search engines based on linkage analysis using a carefully engineered subset of the World Wide Web, WT10g (Bailey, Craswell and Hawking...
Julien Gevrey, Stefan M. Rüger
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 3 days ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
COMPGEOM
2004
ACM
13 years 10 months ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu