Sciweavers

338 search results - page 57 / 68
» Fast distributed random walks
Sort
View
TKDE
2011
528views more  TKDE 2011»
14 years 4 months ago
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
Lakshmish Ramaswamy, Jianxia Chen
MICCAI
2007
Springer
15 years 10 months ago
Robust Computation of Mutual Information Using Spatially Adaptive Meshes
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
Hari Sundar, Dinggang Shen, George Biros, Chenyang...
CP
2009
Springer
15 years 10 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
CBMS
2000
IEEE
15 years 2 months ago
Real-Time Extraction of Carotid Artery Contours from Ultrasound Images
This paper presents the developement of a novel, fullyautomatic tracking and segmentation system to extract the boundary of the carotid artery from ultrasound images in real-time....
Purang Abolmaesumi, Mohammad Reza Sirouspour, S. E...
DKE
2006
67views more  DKE 2006»
14 years 9 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...