Sciweavers

1968 search results - page 353 / 394
» The Complexity of Valued Constraint Models
Sort
View
ICFP
2001
ACM
14 years 8 months ago
Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
FOCS
2007
IEEE
14 years 2 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
PODC
2006
ACM
14 years 2 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
ICIAR
2004
Springer
14 years 1 months ago
Real Time Multiple Object Tracking Based on Active Contours
Abstract. In this paper our purpose is to present some solutions to multiple object tracking in an image sequence with a real time constraint and a possible mobile camera. We propo...
Sébastien Lefèvre, Nicole Vincent
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
14 years 1 months ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet