Sciweavers

2593 search results - page 335 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 2 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
15 years 3 months ago
Varying portfolio construction of stocks using genetic network programming with control nodes
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...
LICS
2009
IEEE
15 years 9 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
JMIV
2006
130views more  JMIV 2006»
15 years 2 months ago
Alternative 2D Shape Representations using the Symmetry Set
Among the many attempts made to represent families of 2D shapes in a simpler way, the Medial Axis (MA) takes a prominent place. Its graphical representation is intuitively appealin...
Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Ma...