Sciweavers

5227 search results - page 313 / 1046
» Constructing New Media
Sort
View
EOR
2007
90views more  EOR 2007»
15 years 7 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
TOPNOC
2008
15 years 7 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
177
Voted
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
15 years 7 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
213
Voted
FOCS
2010
IEEE
15 years 5 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
181
Voted
ICASSP
2009
IEEE
15 years 5 months ago
Fast belief propagation process element for high-quality stereo estimation
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
Chao-Chung Cheng, Chia-Kai Liang, Yen-Chieh Lai, H...