Sciweavers

371 search results - page 61 / 75
» Expanders In Group Algebras
Sort
View
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
14 years 9 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
JSYML
2010
107views more  JSYML 2010»
13 years 7 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
14 years 10 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu
SIGSOFT
2006
ACM
14 years 9 months ago
Local analysis of atomicity sphere for B2B collaboration
Atomicity is a desirable property for business processes to conduct transactions in Business-to-Business (B2B) collaboration. Although it is possible to reason about atomicity of ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
14 years 9 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren