Sciweavers

204 search results - page 40 / 41
» Testing Triangle-Freeness in General Graphs
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Dynamic maintenance of molecular surfaces under conformational changes
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
Eran Eyal, Dan Halperin
CONCUR
2008
Springer
13 years 9 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
NIPS
2003
13 years 8 months ago
Unsupervised Context Sensitive Language Acquisition from a Large Corpus
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
Zach Solan, David Horn, Eytan Ruppin, Shimon Edelm...
IJCAI
1993
13 years 8 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...