Sciweavers

11345 search results - page 2061 / 2269
» Foundations of Computer Science
Sort
View
EOR
2006
130views more  EOR 2006»
15 years 3 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
IPM
2008
123views more  IPM 2008»
15 years 3 months ago
Effectiveness of additional representations for the search result presentation on the web
The presentation of search results on the web has been dominated by the textual form of document representation. On the other hand, the document's visual aspects such as the ...
Hideo Joho, Joemon M. Jose
IJDAR
2006
103views more  IJDAR 2006»
15 years 3 months ago
Table-processing paradigms: a research survey
Tables are a ubiquitous form of communication. While everyone seems to know what a table is, a precise, analytical definition of "tabularity" remains elusive because some...
David W. Embley, Matthew Hurst, Daniel P. Lopresti...
JASIS
2008
77views more  JASIS 2008»
15 years 3 months ago
Citers' use of citees' names: Findings from a qualitative interview-based study
This article focuses on why academic writers in computer science and sociology sometimes supply the reader with more details of citees' names than they need to: why citers na...
Nigel Harwood
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 3 months ago
Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES Andrew Duggan, Masters of Science, 2006 Thesis directed by: Professor Alexand...
Andrew Duggan, Alexander Barg
« Prev « First page 2061 / 2269 Last » Next »