Sciweavers

656 search results - page 18 / 132
» Minimal non-convex words
Sort
View
APCSAC
2004
IEEE
15 years 1 months ago
Validating Word-Oriented Processors for Bit and Multi-word Operations
We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by diffe...
Ruby B. Lee, Xiao Yang, Zhijie Shi
96
Voted
ICTAI
2009
IEEE
15 years 4 months ago
Large-Scale Dependency Knowledge Acquisition and its Extrinsic Evaluation Through Word Sense Disambiguation
Knowledge plays a central role in intelligent systems. Manual knowledge acquisition is very inefficient and expensive. In this paper, we present (1) an automatic method to acquire...
Ping Chen, Wei Ding 0003, Chris Bowes, David Brown
74
Voted
ICALP
2005
Springer
15 years 3 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
SOSP
2007
ACM
15 years 6 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
DRR
2010
15 years 1 days ago
Incorporating linguistic post-processing into whole-book recognition
We describe a technique of linguistic post-processing of whole-book recognition results. Whole-book recognition is a technique that improves recognition of book images using fully...
Pingping Xiu, Henry S. Baird