Sciweavers

4231 search results - page 687 / 847
» Using Language More Responsibly
Sort
View
118
Voted
CP
2007
Springer
15 years 10 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
123
Voted
ICALP
2007
Springer
15 years 9 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
110
Voted
UIST
2006
ACM
15 years 9 months ago
CINCH: a cooperatively designed marking interface for 3D pathway selection
To disentangle and analyze neural pathways estimated from magnetic resonance imaging data, scientists need an interface to select 3D pathways. Broad adoption of such an interface ...
David Akers
143
Voted
IRI
2005
IEEE
15 years 9 months ago
Modeling methodology for application development in petroleum industry
The development of applications for monitoring, control, simulation and diagnosis in the petroleum industry involves a multitude of complex software tools. These tools have their ...
Cong Zhang, Viktor K. Prasanna, Abdollah Orangi, W...
128
Voted
ICALP
2005
Springer
15 years 9 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz