Sciweavers

4315 search results - page 66 / 863
» Sorting in linear time
Sort
View
ICMLA
2008
13 years 9 months ago
A Bayesian Approach to Switching Linear Gaussian State-Space Models for Unsupervised Time-Series Segmentation
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
Silvia Chiappa
TIME
2007
IEEE
14 years 1 months ago
Automated Natural Deduction for Propositional Linear-Time Temporal Logic
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
13 years 7 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Philip N. Klein
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 1 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
MOC
1998
89views more  MOC 1998»
13 years 7 months ago
Approximation of continuous time stochastic processes by a local linearization method
This paper investigates the rate of convergence of an alternative approximation method for stochastic differential equations. The rates of convergence of the one-step and multi-st...
Isao Shoji