Sciweavers

220 search results - page 31 / 44
» corr 2002
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
14 years 9 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
CORR
2002
Springer
110views Education» more  CORR 2002»
14 years 9 months ago
Long Proteins with Unique Optimal Foldings in the H-P Model
It is widely accepted that (1) the natural or folded state of proteins is a global energy minimum, and (2) in most cases proteins fold to a unique state determined by their amino ...
Oswin Aichholzer, David Bremner, Erik D. Demaine, ...
CORR
2002
Springer
87views Education» more  CORR 2002»
14 years 9 months ago
Rerendering Semantic Ontologies: Automatic Extensions to UMLS through Corpus Analytics
In this paper, we discuss the utility and deficiencies of existing ontology resources for a number of language processing applications. We describe a technique for increasing the ...
James Pustejovsky, Anna Rumshisky, José M. ...
DCC
2002
IEEE
15 years 2 months ago
Data Compression of Correlated Non-Binary Sources Using Punctured Turbo Codes
We consider the case of two corr elated non-binary sources. Data compression is achieved by transforming the sequences of non-binary symbols into sequences of bits and then using ...
Ying Zhao, Javier Garcia-Frias
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 10 months ago
A tight quantitative version of Arrow's impossibility theorem
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
Nathan Keller