Sciweavers

523 search results - page 93 / 105
» Graph-Based Induction for General Graph Structured Data
Sort
View
DCG
2010
289views more  DCG 2010»
15 years 2 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
IWCIA
2009
Springer
15 years 8 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
SIGSOFT
1995
ACM
15 years 5 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 2 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
126
Voted
CIKM
2009
Springer
15 years 8 months ago
Group CRM: a new telecom CRM framework from social network perspective
The structure of customer communication network provides us a natural way to understand customers’ relationships. Traditional customer relationship management (CRM) methods focu...
Bin Wu, Qi Ye, Shengqi Yang, Bai Wang