Sciweavers

365 search results - page 72 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
ICVGIP
2008
13 years 8 months ago
Algebraic Splats Representation for Point Based Models
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
Naveen Kumar Bolla, P. J. Narayanan
CCGRID
2005
IEEE
14 years 1 months ago
Mapping DAG-based applications to multiclusters with background workload
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, D...
ANCS
2007
ACM
13 years 11 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
PEWASUN
2008
ACM
13 years 8 months ago
Experimentation and performance evaluation of rate adaptation algorithms in wireless mesh networks
In this paper we present an experimental study conducted in 802.11based mesh networks of three existing rate adaptation algorithms. The aim of this study is twofold. On the one ha...
Emilio Ancillotti, Raffaele Bruno, Marco Conti
ICCAD
2001
IEEE
97views Hardware» more  ICCAD 2001»
14 years 4 months ago
Addressing the Timing Closure Problem by Integrating Logic Optimization and Placement
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
Wilsin Gosti, Sunil P. Khatri, Alberto L. Sangiova...