Sciweavers

914 search results - page 183 / 183
» Branch and Bound on the Network Model
Sort
View
ATAL
2008
Springer
13 years 8 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 7 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
TIP
2008
144views more  TIP 2008»
13 years 6 months ago
Incremental Refinement of Image Salient-Point Detection
Low-level image analysis systems typically detect "points of interest", i.e., areas of natural images that contain corners or edges. Most of the robust and computationall...
Yiannis Andreopoulos, Ioannis Patras
PVLDB
2008
108views more  PVLDB 2008»
13 years 5 months ago
Sliding-window top-k queries on uncertain streams
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
Cheqing Jin, Ke Yi, Lei Chen 0002, Jeffrey Xu Yu, ...