211 search results - page 2 / 43 » Ground Reducibility is EXPTIME-Complete |
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
113
click to vote
DAC
1998
ACM
16 years 5 months ago
1998
ACM
This paper presents a method for power and ground (p/g) network routing for high speed CMOS chips with multiple p/g pads. Our objective is not to reduce the total amount of the gr...
139
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
120
click to vote
CHI
2005
ACM
16 years 4 months ago
2005
ACM
This paper reports on the emergent use of lightweight text chat to provide important grounding and facilitation information in a large, distributed, ad-hoc group of researchers pa...
165
Voted
PAMI
2011
14 years 11 months ago
2011
This paper proposes a general method for improving image descriptors using discriminant projections. Two methods based on Linear Discriminant Analysis have been recently introduce...