Sciweavers

2517 search results - page 15 / 504
» Specifying Weak Sets
Sort
View
DAM
2011
13 years 2 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
SIGGRAPH
2010
ACM
13 years 11 months ago
Physical reproduction of materials with specified subsurface scattering
We investigate a complete pipeline for measuring, modeling, and fabricating objects with specified subsurface scattering behaviors. The process starts with measuring the scatterin...
Miloš Hašan, Martin Fuchs, Wojciech Matusik, Han...
MFCS
2007
Springer
14 years 1 months ago
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
Christoph Behle, Andreas Krebs, Mark Mercer
SEFM
2009
IEEE
14 years 2 months ago
Specifying Interacting Components with Coordinated Concurrent Scenarios
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
Prakash Chandrasekaran, Madhavan Mukund