Sciweavers

1431 search results - page 168 / 287
» The complexity of random ordered structures
Sort
View
175
Voted
CVPR
2012
IEEE
13 years 5 months ago
Bridging the past, present and future: Modeling scene activities from event relationships and global rules
This paper addresses the discovery of activities and learns the underlying processes that govern their occurrences over time in complex surveillance scenes. To this end, we propos...
Jagannadan Varadarajan, Rémi Emonet, Jean-M...
139
Voted
ICIP
2001
IEEE
16 years 5 months ago
Robust fast extraction of video objects combining frame differences and adaptive reference image
This paper introduces a video object segmentation algorithm developed in the context of the European project Art.live1 where constraints on the quality of segmentation and the pro...
Alice Caplier, Laurent Bonnaud, Jean-Marc Chassery
COMPGEOM
2009
ACM
15 years 10 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
114
Voted
ARC
2010
Springer
178views Hardware» more  ARC 2010»
15 years 10 months ago
An Analysis of Delay Based PUF Implementations on FPGA
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabri...
Sergey Morozov, Abhranil Maiti, Patrick Schaumont
138
Voted
CISS
2008
IEEE
15 years 10 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman