Sciweavers

151 search results - page 26 / 31
» Hyperbolic Graphs of Small Complexity
Sort
View
CVPR
2011
IEEE
13 years 7 months ago
Adequate Reconstruction of Transparent Objects on a Shoestring Budget
Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewh...
Sai-Kit Yeung, Tai-Pang Wu, Chi-keung Tang, Tony F...
ICLP
2009
Springer
14 years 11 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
ECBS
1999
IEEE
138views Hardware» more  ECBS 1999»
14 years 3 months ago
Multi-Domain Surety Modeling and Analysis for High Assurance Systems
Engineering systems are becoming increasingly complex as state of the art technologies are incorporated into designs. Surety modeling and analysis is an emerging science which per...
James Davis, Jason Scott, Janos Sztipanovits, Marc...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 11 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
CSR
2010
Springer
14 years 3 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma