2446 search results - page 415 / 490 » Choiceless Polynomial Time |
JAR
2010
13 years 2 months ago
2010
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
MST
2010
13 years 2 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
TCOS
2010
13 years 2 months ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
TON
2010
13 years 2 months ago
2010
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...