Sciweavers

1180 search results - page 106 / 236
» A generic structure-from-motion framework
Sort
View
MP
1998
109views more  MP 1998»
14 years 10 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
LPAR
2012
Springer
13 years 6 months ago
Lazy Abstraction with Interpolants for Arrays
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
Francesco Alberti, Roberto Bruttomesso, Silvio Ghi...
INFOCOM
2012
IEEE
13 years 1 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
ATAL
2005
Springer
15 years 4 months ago
Formal Modeling and Analysis of Organizations
A new, formal, role-based, framework for modeling and analyzing both real world and artificial organizations is introduced. It exploits static and dynamic properties of the organiz...
Egon L. van den Broek, Catholijn M. Jonker, Alexei...
CALCO
2005
Springer
75views Mathematics» more  CALCO 2005»
15 years 4 months ago
Parametrized Exceptions
Following the paradigm of encapsulation of side effects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful ...
Dennis Walter, Lutz Schröder, Till Mossakowsk...