1092 search results - page 197 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
155
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
109
Voted
JALC
2007
15 years 1 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
120
Voted
LATIN
2010
Springer
15 years 7 days ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
136
click to vote
SECON
2010
IEEE
14 years 11 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
166
Voted
PAMI
2012
13 years 4 months ago
2012
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...