71 search results - page 6 / 15 » Automorphisms of Finite Rings and Applications to Complexity... |
PRL
2006
13 years 7 months ago
2006
Various types of moments have been used to recognize image patterns in a number of applications. However, only few works have paid attention to the completeness property of the in...
ACL
1997
13 years 8 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
SIROCCO
2008
13 years 8 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
INFORMS
1998
13 years 7 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...