Sciweavers

4451 search results - page 83 / 891
» On Random Ordering Constraints
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 5 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
ICCV
2011
IEEE
13 years 12 months ago
Conditional Random Fields for Multi-Camera Object Detection
We formulate a model for multi-class object detection in a multi-camera environment. From our knowledge, this is the first time that this problem is addressed taken into account ...
Xavier Boix, Gemma Roig, Horesh Ben Shitrit, Pasca...
INFOCOM
2012
IEEE
13 years 2 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
CP
2000
Springer
15 years 4 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
FS
2006
105views more  FS 2006»
14 years 12 months ago
Financial equilibria in the semimartingale setting: Complete markets and markets with withdrawal constraints
We prove existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria span complete...
Gordan Zitkovic