Sciweavers

686 search results - page 91 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
WWW
2004
ACM
14 years 9 months ago
Small world peer networks in distributed web search
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
Ruj Akavipat, Le-Shin Wu, Filippo Menczer
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 9 months ago
Measuring and extracting proximity in networks
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...
Yehuda Koren, Stephen C. North, Chris Volinsky
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
14 years 6 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
FOIKS
2008
Springer
14 years 5 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
CVPR
2010
IEEE
14 years 5 months ago
A Generative Perspective on MRFs in Low-Level Vision
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
Uwe Schmidt, Qi Gao, Stefan Roth