Sciweavers

1272 search results - page 154 / 255
» Approximate Parameterized Matching
Sort
View
154
Voted
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 3 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
ECCV
2004
Springer
16 years 5 months ago
Simultaneous Object Recognition and Segmentation by Image Exploration
Methods based on local, viewpoint invariant features have proven capable of recognizing objects in spite of viewpoint changes, occlusion and clutter. However, these approaches fail...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
115
Voted
CIKM
2009
Springer
15 years 10 months ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
ICTCS
2005
Springer
15 years 9 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
172
Voted
PODC
2010
ACM
15 years 7 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela