Sciweavers

398 search results - page 16 / 80
» A new biclustering technique based on crossing minimization
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ICNS
2007
IEEE
14 years 1 months ago
IGMPS, a New Tool for Estimating End-to-End Available Bandwidth in IP Network Paths
— This paper presents a new end-to-end available bandwidth measurement tool called IGMPS (Improved Gap Model using Packet Size parameter). IGMPS is a lightweight tool based on a ...
Ahmed Ait Ali, Francis Lepage
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...
CVPR
2006
IEEE
14 years 9 months ago
Edge Suppression by Gradient Field Transformation Using Cross-Projection Tensors
We propose a new technique for edge-suppressing operations on images. We introduce cross projection tensors to achieve affine transformations of gradient fields. We use these tens...
Amit K. Agrawal, Ramesh Raskar, Rama Chellappa
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
13 years 11 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding