Sciweavers

1029 search results - page 125 / 206
» Compact representations of ordered sets
Sort
View
DOCENG
2004
ACM
14 years 3 months ago
A three-way merge for XML documents
Three-way merging is a technique that may be employed for reintegrating changes to a document in cases where multiple independently modified copies have been made. While tools fo...
Tancred Lindholm
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 2 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 10 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
CGO
2010
IEEE
14 years 4 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...
CPAIOR
2007
Springer
14 years 4 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker