Sciweavers

500 search results - page 7 / 100
» Procedure Placement Using Temporal Ordering Information
Sort
View
RTA
1995
Springer
14 years 3 days ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
DATE
2010
IEEE
180views Hardware» more  DATE 2010»
14 years 1 months ago
Reliability- and process variation-aware placement for FPGAs
Abstract—Negative bias temperature instability (NBTI) significantly affects nanoscale integrated circuit performance and reliability. The degradation in threshold voltage (Vth) d...
Assem A. M. Bsoul, Naraig Manjikian, Li Shang
JMLR
2008
159views more  JMLR 2008»
13 years 8 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ECIR
2004
Springer
13 years 10 months ago
Identification of Relevant and Novel Sentences Using Reference Corpus
In the novelty task on sentence level, the amount of information used in similarity computation is the major challenging issue. A shallow NLP approach extracts noun and verb featu...
Hsin-Hsi Chen, Ming-Feng Tsai, Ming-Hung Hsu
ASE
1999
90views more  ASE 1999»
13 years 8 months ago
A Concept Formation Based Approach to Object Identification in Procedural Code
Legacy software systems present a high level of entropy combined with imprecise documentation. This makes their maintenance more difficult, more time consuming, and costlier. In or...
Houari A. Sahraoui, Hakim Lounis, Walcélio ...