Sciweavers

42230 search results - page 14 / 8446
» Algorithms and Complexity Results for
Sort
View
EDBT
2010
ACM
153views Database» more  EDBT 2010»
14 years 2 months ago
Suggestion of promising result types for XML keyword search
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
FOCS
2006
IEEE
14 years 1 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ICALP
2000
Springer
13 years 11 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée