Sciweavers

2520 search results - page 185 / 504
» The complexity of approximating entropy
Sort
View
ECCC
2010
98views more  ECCC 2010»
14 years 11 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
COMPLEX
2009
Springer
15 years 5 months ago
Differential Forms: A New Tool in Economics
Investors would like to calculate profits in advance, “ex ante”, like the path of a flying ball. But income can only be given “ex post”, after the money is earned. The pro...
Jürgen Mimkes
ICRA
2007
IEEE
89views Robotics» more  ICRA 2007»
15 years 5 months ago
Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Si...
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 11 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
ICC
2007
IEEE
172views Communications» more  ICC 2007»
15 years 5 months ago
Simple Carrier Frequency Offset Estimators in Frequency Flat-Fading Channels
— In this paper, the Nonlinear Least-Squares (NLS) estimator for frequency offset in flat-fading channels is systematically derived. A simple interpolation technique is introduc...
Pakorn Ubolkosold, Gustave Franck Tchere, Stefan K...