Sciweavers

430 search results - page 14 / 86
» A New Linearizing Restriction in the Pattern Matching Proble...
Sort
View
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 2 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 8 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
SIAMSC
2010
120views more  SIAMSC 2010»
13 years 6 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...
CDB
2004
Springer
172views Database» more  CDB 2004»
14 years 1 months ago
Constraint Database Solutions to the Genome Map Assembly Problem
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...
Viswanathan Ramanathan, Peter Z. Revesz
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 9 months ago
Real scaled matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
Amihood Amir, Ayelet Butman, Moshe Lewenstein