Vitit Kantabutra - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2022

Implementing Hypergraph Databases with Fast Relationship Linking and Traversal Using ILEVitit Kantabutra. csci 2022: 742-747 [doi]

2018

Comparative Analysis of Various Design Implementations of CLA Carry ChainsNaga Spandana Muppaneni, Steve C. Chiu, Vitit Kantabutra, Farshad Dailami. eit 2018: 713-718 [doi]

2013

A Clear Temporal GIS Viewer and Software for Discovering Irregularities in Historical GISVitit Kantabutra, J. B. Owens. dihu 2013: 251-252 [doi]

2011

Modeling Event-Based Historical Narratives: A Conversation Between Digital Humanists, Information Scientists and Computer ScientistsElijah Meeks, Ruth Mostern, Karl E. Grossner, Ryan Shaw 0001, Ramesh Jain, Vitit Kantabutra. dihu 2011: 45-46 [doi]

Better Software Tools for the Humanities and the Social Sciences: A Computer Science PerspectiveRussell Stephenson, Vitit Kantabutra. dihu 2011: 370 [doi]

2010

On the Benefits of using Linked Data Structures and Dynamically-Allocated Memory for the Modeling and Visualization of Practical Complex SystemsVitit Kantabutra, Charles Burns. msv 2010: 23-28

2009

An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular PolygonsVitit Kantabutra. fcs 2009: 92-94

2007

A New Type of Database Systems: Intentionally-Linked Entities - a Detailed Suggestion for a Direct Way to Implement the Entity-Relationship Data ModelVitit Kantabutra. csreaEEE 2007: 258-263

2006

Towards Reliable Convergence in the Training of Neural Networks - The Streamlined Glide Algorithm and the LM Glide AlgorithmVitit Kantabutra. mlmta 2006: 80-87

2004

Area- and Power-Reduced Standard-Cell Spanning Tree AddersPasquale Corsonello, Stefania Perri, Vitit Kantabutra. csreaESA 2004: 343-352

1999

High-radix CORDIC for vector rotation with pipelined FPGA implementationVitit Kantabutra. icecsys 1999: 1131-1134 [doi]

1997

Reaching a Point with an Unanchored Robot Arm in a SquareVitit Kantabutra. ijcga, 7(6):539-550, 1997.

1996

On Hardware for Computing Exponential and Trigonometric FunctionsVitit Kantabutra. TC, 45(3):328-339, 1996.

1994

A State Assignment Approach to Asynchronous CMOS Circuit DesignVitit Kantabutra, Andreas G. Andreou. TC, 43(4):460-469, 1994.

A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex PolygonsVitit Kantabutra. jcss, 49(2):325-333, 1994.

1993

Accelerated Two-Level Carry-Skip Adders-A Type of Very Fast AddersVitit Kantabutra. TC, 42(11):1389-1393, 1993.

Designing Optimum One-Level Carry-Skip AddersVitit Kantabutra. TC, 42(6):759-764, 1993.

A Recursive Carry-Lookahead/Carry-Select Hybrid AdderVitit Kantabutra. TC, 42(12):1495-1499, 1993.

1992

Motions of a Short-Linked Robot Arm in a SquareVitit Kantabutra. dcg, 7:69-76, 1992.

1991

Designing optimum carry-skip addersVitit Kantabutra. arith 1991: 146-153 [doi]

1988

A lower bound on the path length of binary treesVitit Kantabutra. sigact, 19(2):48-50, 1988. [doi]

1986

New Algorithms for Multilink Robot ArmsVitit Kantabutra, S. Rao Kosaraju. jcss, 32(1):136-153, 1986.

1983

Traveling Salesman Cycles are not Always Subgraphs of Voronoi DualsVitit Kantabutra. ipl, 16(1):11-12, 1983.

Sign in or sign up to see more results.

runs on WebDSL