203 search results - page 17 / 41 » Exponentiable morphisms of domains |
163
click to vote
IJCAI
2007
15 years 7 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
144
click to vote
DSP
2006
15 years 5 months ago
2006
In this paper we describe a method for simultaneously estimating the direction of arrival (DOA) of the signal along with its unknown frequency. In a typical DOA estimation problem...
156
click to vote
TC
2008
15 years 5 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
167
click to vote
CORR
2011
Springer
15 years 15 days ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
147
click to vote
AAAI
2008
15 years 7 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...