Sciweavers

2463 search results - page 236 / 493
» Rankings of Directed Graphs
Sort
View
PR
2007
134views more  PR 2007»
15 years 3 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
15 years 1 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 8 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
KDD
1994
ACM
117views Data Mining» more  KDD 1994»
15 years 8 months ago
Application of the TETRAD II Program to the Study of Student Retention in U.S. Colleges
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
Marek J. Druzdze, Clark Glymour
SPAA
2004
ACM
15 years 9 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran