Sciweavers

1952 search results - page 100 / 391
» Complete partitions of graphs
Sort
View
DLOG
2007
15 years 6 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
ICSEA
2006
IEEE
15 years 10 months ago
A Partition-Based Approach for XPath Testing
—The XML language is becoming the preferred means of data interchange and representation in web based applications. Usually, XML data is stored in XML repositories, which can be ...
Claudio de la Riva, José García-Fanj...
INFOCOM
2000
IEEE
15 years 8 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
DM
2006
91views more  DM 2006»
15 years 4 months ago
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
Alexander Burstein, Sergi Elizalde, Toufik Mansour
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 1 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...