Sciweavers

3134 search results - page 23 / 627
» Computing full disjunctions
Sort
View
NCA
2006
IEEE
14 years 3 months ago
Full QoS Support with 2 VCs for Single-chip Switches
Current interconnection standards providing hardware support for quality of service (QoS) consider up to 16 virtual channels (VCs) for this purpose. However, most implementations ...
Alejandro Martínez, Francisco José A...
ECIS
2000
13 years 11 months ago
Full Bindingness and Confidentiality
As electronic commerce will increase, players will increasingly wish to have signed documents and strong encryption. According to current knowledge, it must be expected that the co...
Arnd Weber
ACIVS
2009
Springer
13 years 7 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
AAAI
2000
13 years 11 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary
ACL
2006
13 years 11 months ago
Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
Elliot Glaysher, Dan I. Moldovan