The following pages link to Takeshi Tokuyama (Q202562):
Displaying 50 items.
- A generalization of the convex Kakeya problem (Q486985) (← links)
- A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218) (← links)
- Zone diagrams in Euclidean spaces and in other normed spaces (Q695282) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- On the decomposition rules of tensor products of the representations of the classical Weyl groups (Q790240) (← links)
- A theorem on the representations of the Weyl groups of type \(D_ n\) and \(B_ n\) (Q794758) (← links)
- Efficiently pricing European-Asian options-ultimate implementation and analysis of the AMO algorithm (Q845869) (← links)
- Minimizing interference of a wireless ad-hoc network in a plane (Q936528) (← links)
- Voronoi diagrams with respect to criteria on vision information (Q946853) (← links)
- Distance \(k\)-sectors exist (Q991184) (← links)
- The generating function of strict Gelfand patterns and some formulas on characters of general linear groups (Q1100279) (← links)
- Determinantal method and the Littlewood-Richardson rule (Q1108383) (← links)
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- Mining optimized association rules for numeric attributes (Q1305916) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Implementation and evaluation of decision trees with range and region splitting (Q1378386) (← links)
- How to cut pseudoparabolas into segments (Q1380780) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- A characterization of planar graphs by pseudo-line arrangements (Q1400888) (← links)
- (Q1600988) (redirect page) (← links)
- Optimal online algorithms for an electronic commerce money distribution system (Q1600989) (← links)
- \(k\)-levels of concave surfaces (Q1611064) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence (Q1770423) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- Efficient algorithms for the minimum diameter bridge problem (Q1869735) (← links)
- The structure and number of global roundings of a graph (Q1884844) (← links)
- Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition (Q1889829) (← links)
- Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays (Q2172660) (← links)
- Algorithms for projecting points to give the most uniform distribution with applications to hashing (Q2366237) (← links)
- Splitting a configuration in a simplex (Q2366245) (← links)
- Recent progress on combinatorics and algorithms for low discrepancy roundings (Q2373430) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Order-preserving matching (Q2437748) (← links)
- A fast, accurate, and simple method for pricing European-Asian and saving-Asian options (Q2484002) (← links)
- Linear time algorithm for approximating a curve by a single-peaked curve (Q2492629) (← links)
- (Q2708237) (← links)
- (Q2722004) (← links)
- Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication. (Q2725500) (← links)
- Buyback Problem with Discrete Concave Valuation Functions (Q2788992) (← links)
- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information (Q2872068) (← links)
- (Q2934662) (← links)
- The Structure and Number of Global Roundings of a Graph (Q3082920) (← links)
- EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX (Q3084688) (← links)
- (Q3084810) (← links)
- Data Mining with optimized two-dimensional association rules (Q3507285) (← links)
