Sciweavers

702 search results - page 55 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
APCCM
2009
15 years 28 days ago
Extracting Conceptual Graphs from Japanese Documents for Software Requirements Modeling
A requirements analysis step plays a significant role on the development of information systems, and in this step we various kinds of abstract models of the systems (called requir...
Ryo Hasegawa, Motohiro Kitamura, Haruhiko Kaiya, M...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 3 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
AI
2000
Springer
14 years 11 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
BMCBI
2008
138views more  BMCBI 2008»
14 years 12 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
IVC
2008
223views more  IVC 2008»
14 years 11 months ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh