Sciweavers

436 search results - page 49 / 88
» Recursion and Complexity
Sort
View
ICIP
2005
IEEE
14 years 10 months ago
Irregular pattern matching using projections
Recently, a novel approach to pattern matching was introduced, which reduces time complexity by two orders of magnitude over traditional approaches. It uses an efficient projectio...
Michal Ben-Yehuda, Lihi Cadany, Hagit Hel-Or
ICIP
2001
IEEE
14 years 10 months ago
Coding theoretic approach to image segmentation
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...
Mário A. T. Figueiredo, Robert D. Nowak, Un...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 10 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
RECOMB
2006
Springer
14 years 9 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
GLOBECOM
2009
IEEE
14 years 3 months ago
A Fresh Look at Multicanonical Monte Carlo from a Telecom Perspective
—The Multicanonical Monte Carlo (MMC) technique is a new form of adaptive importance sampling (IS). Thanks to its blind adaptation algorithm, it does not require an in-depth syst...
Alberto Bononi, Leslie A. Rusch, Amirhossein Ghazi...