Sciweavers

1578 search results - page 178 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
INFOCOM
2008
IEEE
14 years 3 months ago
Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding
—In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization o...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 3 months ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
MICCAI
2007
Springer
14 years 10 months ago
De-enhancing the Dynamic Contrast-Enhanced Breast MRI for Robust Registration
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...
Yuanjie Zheng, Jingyi Yu, Chandra Kambhamettu, Sar...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 9 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn