Sciweavers

1629 search results - page 297 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
PROMISE
2010
14 years 4 months ago
Exploiting count spectra for Bayesian fault localization
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
Rui Abreu, Alberto González-Sanchez, Arjan ...
LACL
2011
Springer
14 years 18 days ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
FCCM
2000
IEEE
162views VLSI» more  FCCM 2000»
15 years 2 months ago
StReAm: Object-Oriented Programming of Stream Architectures Using PAM-Blox
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
Oskar Mencer, Heiko Hübert, Martin Morf, Mich...
WWW
2005
ACM
15 years 10 months ago
Object-level ranking: bringing order to Web objects
In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level....
Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, Wei-Ying ...
ICPADS
1994
IEEE
15 years 1 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...