Sciweavers

461 search results - page 23 / 93
» Splitting NP-Complete Sets
Sort
View
LICS
1991
IEEE
14 years 2 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
BMCBI
2008
214views more  BMCBI 2008»
13 years 11 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
TIME
2008
IEEE
14 years 5 months ago
Decomposition of Decidable First-Order Logics over Integers and Reals
We tackle the issue of representing infinite sets of realvalued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose ...
Florent Bouchy, Alain Finkel, Jérôme ...
ICPR
2004
IEEE
15 years 22 hour ago
Object Recognition Using Segmentation for Feature Detection
: A new method is presented to learn object categories from unlabeled and unsegmented images for generic object recognition. We assume that each object can be characterized by a se...
Andreas Opelt, Axel Pinz, Michael Fussenegger, Pet...
ICPADS
2008
IEEE
14 years 5 months ago
Bootstrapping in Peer-to-Peer Systems
Peer-to-Peer systems have become a substantial element in computer networking. Distributing the load and splitting complex tasks are only some reasons why many developers have com...
Mirko Knoll, Arno Wacker, Gregor Schiele, Torben W...