Sciweavers

4315 search results - page 139 / 863
» Sorting in linear time
Sort
View
ICIP
2007
IEEE
14 years 10 months ago
Modeling Time-Varying Illumination Patterns in Video
Recreating the temporal illumination variations of natural scenes has great potential for realistic synthesis of video sequences. In this paper, we present a 3D (model-based) appr...
Yilei Xu, Amit K. Roy Chowdhury
BMCBI
2005
108views more  BMCBI 2005»
13 years 9 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
CADE
2006
Springer
14 years 9 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
CHI
2002
ACM
14 years 9 months ago
Automated message prioritization: making voicemail retrieval more efficient
Navigating through new voicemail messages to find messages of interest is a time-consuming task, particularly for high-volume users. When checking messages under a time constraint...
Meridith Ringel, Julia Hirschberg
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
14 years 23 days ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...