Sciweavers

2089 search results - page 369 / 418
» A New Problem in String Searching
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
14 years 9 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
TIT
2002
81views more  TIT 2002»
14 years 9 months ago
The decimation-Hadamard transform of two-level autocorrelation sequences
A new method to study and search for two-level autocorrelation sequences for both binary and nonbinary cases is developed. This method iteratively applies two operations: decimatio...
Guang Gong, Solomon W. Golomb
TSMC
2002
114views more  TSMC 2002»
14 years 9 months ago
Exploiting design information to derive object distribution models
Object-orientation and distributed systems are quickly becoming norms for new system development, generating renewed interest in distribution schemes traditionally directed at rela...
Sandeep Purao, Hemant K. Jain, Derek L. Nazareth
INFOCOM
2010
IEEE
14 years 8 months ago
Toward the Practical Use of Network Tomography for Internet Topology Discovery
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
Brian Eriksson, Gautam Dasarathy, Paul Barford, Ro...
JCSS
2010
190views more  JCSS 2010»
14 years 8 months ago
Pattern matching with don't cares and few errors
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Raphaël Clifford, Klim Efremenko, Ely Porat, ...