Sciweavers

316 search results - page 41 / 64
» Resource Combinatory Algebras
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
13 years 10 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 10 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 10 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
FLAIRS
2003
13 years 10 months ago
Optimal Approach for Temporal Patterns Discovery
This paper presents new technique for discovering temporal patterns when considered primitives are intervals. Apriori technique is the most used one to deal with temporal patterns...
Khellaf Bouandas, Aomar Osmani