Sciweavers

28888 search results - page 296 / 5778
» Computability and complexity in analysis
Sort
View
ADBIS
2006
Springer
131views Database» more  ADBIS 2006»
16 years 20 days ago
X-Warehousing: An XML-Based Approach for Warehousing Complex Data
XML is suitable for structuring complex data coming from different sources and supported by heterogeneous formats. It allows a flexible formalism capable to represent and store d...
Omar Boussaid, Riadh Ben Messaoud, Rémy Cho...
ICDAR
2005
IEEE
16 years 8 days ago
Text Extraction from Name Cards with Complex Design
This paper addresses the problem of text extraction from name card images with fanciful design containing complicated color background and reverse contrast regions. The proposed m...
Lin Lin, Chew Lim Tan
172
Voted
ACMSE
2006
ACM
15 years 10 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.
ICALT
2006
IEEE
16 years 22 days ago
Effective Analysis and Design of Computer-Supported Learning System
The analysis phase constitutes an essential step in the development of information systems. Nevertheless, learning materials design activities currently have reduced the analysis ...
David Díez Cebollero, Camino Fernánd...
EUROCRYPT
2004
Springer
16 years 1 days ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz