Sciweavers

IEEEVAST
2010
13 years 6 months ago
Interactive visual analysis of multiobjective optimizations
Optimization problems are typically addressed by purely automatic approaches. For multi-objective problems, however, a single best solution often does not exist. In this case, it ...
Wolfgang Berger, Harald Piringer
ICFHR
2010
194views Biometrics» more  ICFHR 2010»
13 years 6 months ago
ICFHR 2010 Contest: Quantitative Evaluation of Binarization Algorithms
This paper describes the ICFHR 2010 Contest for quantitative evaluation of binarization algorithms. These algorithm are applied to synthetic images of modern pdf documents with noi...
Roberto Paredes, Ergina Kavallieratou, Rafael Duei...
WWW
2011
ACM
13 years 6 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
TSP
2011
152views more  TSP 2011»
13 years 6 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 6 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
13 years 6 months ago
Adaptive bases for Q-learning
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
Dotan Di Castro, Shie Mannor
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 6 months ago
Multiply-Recursive Upper Bounds with Higman's Lemma
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
Sylvain Schmitz, Philippe Schnoebelen
WWW
2011
ACM
13 years 6 months ago
Generalized fact-finding
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...
Jeff Pasternack, Dan Roth
WWW
2011
ACM
13 years 6 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
WWW
2011
ACM
13 years 6 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya