Sciweavers

1688 search results - page 45 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
14 years 2 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
MOBICOM
2006
ACM
14 years 4 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
ICSE
2007
IEEE-ACM
14 years 10 months ago
Engineering Medical Information Systems: Architecture, Data and Usability & Security
There has been increasing pressure on the health care sector to adopt information technologies to rationalize service delivery and increase service quality. Medical information sy...
Jens H. Weber-Jahnke, Morgan Price
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 10 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
CONTEXT
2003
Springer
14 years 3 months ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...