Sciweavers

6409 search results - page 185 / 1282
» A Computational Algorithm for Origami Design
Sort
View
ENC
2004
IEEE
15 years 10 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
DAC
1995
ACM
15 years 10 months ago
New Performance-Driven FPGA Routing Algorithms
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signi...
Michael J. Alexander, Gabriel Robins
EUROCAST
2005
Springer
182views Hardware» more  EUROCAST 2005»
15 years 12 months ago
Computer Vision Application: Real Time Smart Traffic Light
Abstract. The design, development, construction and testing of an ArtificialVision controlled Traffic-Light prototype has been carried out to rule and regulate intersections. Metho...
Ángel Serrano, Cristina Conde, Licesio J. R...
APL
1993
ACM
15 years 10 months ago
The Role of APL and J in High-Performance Computation
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
Robert Bernecky
SIGCOMM
1994
ACM
15 years 10 months ago
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an inno...
Charles E. Perkins, Pravin Bhagwat