Sciweavers

9842 search results - page 1425 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
AVSS
2006
IEEE
16 years 1 months ago
Nonparametric Background Modeling Using the CONDENSATION Algorithm
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
Xingzhi Luo, Suchendra M. Bhandarkar, Wei Hua, Hai...
MEMOCODE
2006
IEEE
16 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
COMPGEOM
2006
ACM
16 years 1 months ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
16 years 19 days ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
16 years 19 days ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
« Prev « First page 1425 / 1969 Last » Next »