Sciweavers

552 search results - page 106 / 111
» Direct Optimization of Ranking Measures
Sort
View
AI
2011
Springer
14 years 5 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
78
Voted
ICPR
2004
IEEE
15 years 11 months ago
BTF Image Space Utmost Compression and Modelling Method
The bidirectional texture function (BTF) describes texture appearance variations due to varying illumination and viewing conditions. This function is acquired by large number of m...
Jirí Filip, Michael Arnold, Michal Haindl
ICML
2006
IEEE
15 years 11 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
SIGSOFT
2002
ACM
15 years 10 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
135
Voted
WWW
2008
ACM
15 years 10 months ago
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, B...