Sciweavers

402 search results - page 53 / 81
» Practical Application of Existing Hypermedia Standards and T...
Sort
View
EMMCVPR
2001
Springer
15 years 3 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
AGENTS
2000
Springer
15 years 3 months ago
Scalability of a Transactional Infrastructure for Multi-Agent Systems
Abstract. One of the reasons for attending to agent technology is the evergrowing complexity of information systems and the increasing difficulty to foresee and plan for all potent...
Khaled Nagi
WSC
2007
15 years 1 months ago
Building composable bridges between the conceptual space and the implementation space
Often the process and effort in building interoperable Command and Control (C2) systems and simulations can be arduous. Invariably the difficulty is in understanding what is inten...
Paul Gustavson, Tram Chase
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
15 years 21 days ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
13 years 11 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert