Sciweavers

2778 search results - page 14 / 556
» Limit complexities revisited
Sort
View
ICALP
2003
Springer
15 years 3 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
MST
2010
117views more  MST 2010»
14 years 4 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
ACL
2012
13 years 6 days ago
Arabic Retrieval Revisited: Morphological Hole Filling
Due to Arabic’s morphological complexity, Arabic retrieval benefits greatly from morphological analysis – particularly stemming. However, the best known stemming does not hand...
Kareem Darwish, Ahmed Ali
HICSS
2003
IEEE
98views Biometrics» more  HICSS 2003»
15 years 3 months ago
On the Limits of Bottom-Up Computer Simulation: Towards a Nonlinear Modeling Culture
1 In the complexity and simulation communities there is growing support for the use of bottom-up computer-based simulation in the analysis of complex systems. The presumption is th...
Kurt A. Richardson
ACSD
2007
IEEE
67views Hardware» more  ACSD 2007»
15 years 4 months ago
Hazard Checking of Timed Asynchronous Circuits Revisited
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
Frédéric Béal, Tomohiro Yoned...