3946 search results - page 187 / 790 » The computational complexity of choice sets |
175
click to vote
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
The complexity of modern mobile phones makes it difficult for developers to understand the power consumption of their applications. Our measurement framework produces fine-graine...
190
click to vote
ACL
2012
13 years 9 months ago
2012
This paper presents the problem within Hittite and Ancient Near Eastern studies of fragmented and damaged cuneiform texts, and proposes to use well-known text classification metr...
205
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
260
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
158
click to vote
ICS
2004
Tsinghua U.
15 years 12 months ago
2004
Tsinghua U.
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...