194 search results - page 28 / 39 » Randomness for Free |
108
click to vote
KDD
2012
ACM
13 years 2 days ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
BMCBI
2007
14 years 9 months ago
2007
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We formulate a robust method using Expectation Maximization (EM) to address the problem of dense photometric stereo. Previous approaches using Markov Random Fields (MRF) ...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...