Sciweavers

4926 search results - page 65 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ISBI
2011
IEEE
12 years 11 months ago
Boosting power to detect genetic associations in imaging using multi-locus, genome-wide scans and ridge regression
Most algorithms used for imaging genetics examine statistical effects of each individual genetic variant, one at a time. We developed a new approach, based on ridge regression, to...
Omid Kohannim, Derrek P. Hibar, Jason L. Stein, Ne...
ACIVS
2007
Springer
14 years 1 months ago
Joint Tracking and Segmentation of Objects Using Graph Cuts
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
Aurélie Bugeau, Patrick Pérez
ATAL
2008
Springer
13 years 9 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
COMPGEOM
2010
ACM
14 years 24 days ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
TCS
2008
13 years 7 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy