Sciweavers

1511 search results - page 132 / 303
» On the effectiveness of address-space randomization
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins
MST
2010
93views more  MST 2010»
13 years 6 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
ATAL
2009
Springer
13 years 6 months ago
Learning to Locate Trading Partners in Agent Networks
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...
John Porter, Kuheli Chakraborty, Sandip Sen
CHI
2009
ACM
13 years 6 months ago
Semantically structured tag clouds: an empirical evaluation of clustered presentation approaches
Tag clouds have become a frequently used interaction technique in the web. Recently several approaches to present tag clouds with the tags semantically clustered have been propose...
Johann Schrammel, Michael Leitner, Manfred Tscheli...