Sciweavers

6769 search results - page 187 / 1354
» A new concept of robustness
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
SMILE
2000
Springer
14 years 22 days ago
A Progressive Scheme for Stereo Matching
Brute-forcedensematchingisusuallynotsatisfactorybecausethesame search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progr...
Zhengyou Zhang, Ying Shan
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 9 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
JAIR
2000
123views more  JAIR 2000»
13 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
AAAI
2012
11 years 11 months ago
Multinomial Relation Prediction in Social Data: A Dimension Reduction Approach
The recent popularization of social web services has made them one of the primary uses of the World Wide Web. An important concept in social web services is social actions such as...
Nozomi Nori, Danushka Bollegala, Hisashi Kashima