Sciweavers

150 search results - page 14 / 30
» Fast Unimodular Counting
Sort
View
WSCG
2003
143views more  WSCG 2003»
13 years 9 months ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which â...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
ARCS
2009
Springer
14 years 2 months ago
Ultra-Fast Downloading of Partial Bitstreams through Ethernet
Abstract. In this paper we present a partial bitstreams ultra-fast downloading process through a standard Ethernet network. These Virtex-based and partially reconï¬gurable systems...
Pierre Bomel, Jeremie Crenne, Linfeng Ye, Jean-Phi...
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
14 years 28 days ago
Fast mining of spatial collocations
Spatial collocation patterns associate the co-existence of nonspatial features in a spatial neighborhood. An example of such a pattern can associate contaminated water reservoirs ...
Xin Zhang, Nikos Mamoulis, David W. Cheung, Yutao ...
CF
2010
ACM
13 years 11 months ago
Towards chip-on-chip neuroscience: fast mining of neuronal spike streams using graphics hardware
Computational neuroscience is being revolutionized with the advent of multi-electrode arrays that provide real-time, dynamic perspectives into brain function. Mining neuronal spik...
Yong Cao, Debprakash Patnaik, Sean P. Ponce, Jerem...