Sciweavers

343 search results - page 44 / 69
» On Making Directed Graphs Transitive
Sort
View
137
Voted
SARA
2009
Springer
15 years 8 months ago
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
Miroslav N. Velev, Ping Gao 0002
JCDL
2004
ACM
134views Education» more  JCDL 2004»
15 years 7 months ago
Exploring the relationship between personal and public annotations
Today people typically read and annotate printed documents even if they are obtained from electronic sources like digital libraries. If there is a reason for them to share these p...
Catherine C. Marshall, A. J. Bernheim Brush
CGF
2004
86views more  CGF 2004»
15 years 1 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 15 days ago
BioBlender: a Software for Intuitive Representation of Surface Properties of Biomolecules
In this and the associated article BioBlender: A Software for Intuitive Representation of Surface Properties of Biomolecules [1], we present BioBlender as a complete instrument fo...
Raluca Mihaela Andrei, Marco Callieri, Maria Franc...
CN
2007
91views more  CN 2007»
15 years 1 months ago
Improving the quality of alerts and predicting intruder's next goal with Hidden Colored Petri-Net
Intrusion detection systems (IDS) often provide poor quality alerts, which are insufficient to support rapid identification of ongoing attacks or predict an intruder’s next lik...
Dong Yu, Deborah A. Frincke