Sciweavers

1960 search results - page 355 / 392
» The Logic of Large Enough
Sort
View
COLING
2010
13 years 3 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
VLSISP
2011
216views Database» more  VLSISP 2011»
13 years 3 months ago
Accurate Area, Time and Power Models for FPGA-Based Implementations
This paper presents accurate area, time, power estimation models for implementations using FPGAs from the Xilinx Virtex-2Pro family [1]. These models are designed to facilitate ef...
Lanping Deng, Kanwaldeep Sobti, Yuanrui Zhang, Cha...
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 20 days ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
SIGSOFT
2002
ACM
14 years 9 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
WWW
2007
ACM
14 years 9 months ago
Toward expressive syndication on the web
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
Christian Halaschek-Wiener, James A. Hendler