Sciweavers

22 search results - page 4 / 5
» Searching for a k-clique in unknown graphs
Sort
View
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 10 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
NIPS
2001
14 years 11 months ago
Unsupervised Learning of Human Motion Models
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...
Yang Song, Luis Goncalves, Pietro Perona
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...
SOFTVIS
2010
ACM
14 years 10 months ago
Embedding spatial software visualization in the IDE: an exploratory study
Software visualization can be of great use for understanding and exploring a software system in an intuitive manner. Spatial representation of software is a promising approach of ...
Adrian Kuhn, David Erni, Oscar Nierstrasz