2440 search results - page 191 / 488 » Data-Intensive Question Answering |
JSC
2007
15 years 4 months ago
2007
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...
160
click to vote
APAL
2004
15 years 4 months ago
2004
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
108
click to vote
JSYML
2002
15 years 3 months ago
2002
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
76
Voted
TIS
1998
15 years 3 months ago
1998
The Principles of Fair Information Practice are almost three decades old and need to be broadened to take account of new technologies for collecting personal information such as d...
143
Voted
MOBILIGHT
2010
15 years 2 months ago
2010
Abstract. Mobile network operators demand small base station antennas and high physical layer throughputs. In the downlink, high physical layer throughputs can be achieved by explo...