Sciweavers

24 search results - page 2 / 5
» dim 2008
Sort
View
DM
1999
110views more  DM 1999»
13 years 4 months ago
Chow's theorem for linear spaces
If : L L is a bijection from the set of lines of a linear space (P, L) onto the set of lines of a linear space (P , L ) (dim (P, L), dim (P , L ) 3), such that intersecting lin...
Hans Havlicek
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
13 years 6 months ago
Towards Dimension Expanders over Finite Fields
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
Zeev Dvir, Amir Shpilka
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Connectivity Properties of Dimension Level Sets
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
Jack H. Lutz, Klaus Weihrauch
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
13 years 6 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
DIM
2008
ACM
13 years 6 months ago
Proposal of privacy policy matching engine
We propose a system called "Privacy Policy Matching Engine", which enables a matching of a user's intention to provide his/her identity-related data and enterprises...
Takao Kojima, Yukio Itakura