Results 1  10
of
7,753
Equivalence of deterministic onecounter automata is NLcomplete
 CORR
, 2013
"... We prove that language equivalence of deterministic onecounter automata is NLcomplete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic onecounter automata are inequivalent if and only i ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We prove that language equivalence of deterministic onecounter automata is NLcomplete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic onecounter automata are inequivalent if and only
A Note on the Pcompleteness of Deterministic Oneway
"... Abstract: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time. ..."
Abstract
 Add to MetaCart
Abstract: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
Articulated body motion capture by annealed particle filtering
 In IEEE Conf. on Computer Vision and Pattern Recognition
, 2000
"... The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach is to intr ..."
Abstract

Cited by 494 (4 self)
 Add to MetaCart
The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
 IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate, mini ..."
Abstract

Cited by 496 (14 self)
 Add to MetaCart
We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
"... The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is Σ11complete (analyticcomplete) as a set in Cantor space. This already shows that the unambiguous languages are topologically more complex than the deterministic ones, that are all in Π11. ..."
Abstract
 Add to MetaCart
The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is Σ11complete (analyticcomplete) as a set in Cantor space. This already shows that the unambiguous languages are topologically more complex than the deterministic ones, that are all in Π11
A simple parallel algorithm for the maximal independent set problem
 SIAM Journal on Computing
, 1986
"... Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intel ..."
Abstract

Cited by 450 (9 self)
 Add to MetaCart
intelligence. One of the main contributions of this paper is the development of powerful and general technicjues for converting Monte Carlo algorithms into deterministic algorithms. These techniques arc used to convert the Monte Carlo algorithm for the MIS problem into a simple deterministic algorithm
Coverage Problems in Wireless Adhoc Sensor Networks
 in IEEE INFOCOM
, 2001
"... Wireless adhoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new systembuilding challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as ..."
Abstract

Cited by 441 (9 self)
 Add to MetaCart
, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. In this paper, we address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
, but has several limitations. First, it is oriented toward finding deterministic policies, whereas the optimal policy is often stochastic, selecting different actions with specific probabilities (e.g., see In this paper we explore an alternative approach to function approximation in RL. Rather than
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract

Cited by 296 (42 self)
 Add to MetaCart
the Gaussian model but still captures two key wireless channel properties of broadcast and superposition. We consider a model for a wireless relay network with nodes connected by such deterministic channels, and present an exact characterization of the endtoend capacity when there is a single source and one
Partial parsing via finitestate cascades
 Natural Language Engineering
, 1996
"... Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers d ..."
Abstract

Cited by 340 (4 self)
 Add to MetaCart
Finitestate cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finitestate cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers
Results 1  10
of
7,753