Sciweavers

683 search results - page 99 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
COMPGEOM
2010
ACM
14 years 27 days ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
CEC
2009
IEEE
14 years 2 months ago
Evolving hypernetwork models of binary time series for forecasting price movements on stock markets
— The paper proposes a hypernetwork-based method for stock market prediction through a binary time series problem. Hypernetworks are a random hypergraph structure of higher-order...
Elena Bautu, Sun Kim, Andrei Bautu, Henri Luchian,...
EMMCVPR
2011
Springer
12 years 7 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
CVIU
2006
222views more  CVIU 2006»
13 years 7 months ago
Conditional models for contextual human motion recognition
We present algorithms for recognizing human motion in monocular video sequences, based on discriminative Conditional Random Field (CRF) and Maximum Entropy Markov Models (MEMM). E...
Cristian Sminchisescu, Atul Kanaujia, Dimitris N. ...
BMCBI
2005
178views more  BMCBI 2005»
13 years 7 months ago
A quantization method based on threshold optimization for microarray short time series
Background: Reconstructing regulatory networks from gene expression profiles is a challenging problem of functional genomics. In microarray studies the number of samples is often ...
Barbara Di Camillo, Fatima Sanchez-Cabo, Gianna To...