Sciweavers

3875 search results - page 773 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
WABI
2007
Springer
102views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Homology Search with Fragmented Nucleic Acid Sequence Patterns
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
Axel Mosig, Julian J.-L. Chen, Peter F. Stadler
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 1 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
MM
2004
ACM
165views Multimedia» more  MM 2004»
14 years 27 days ago
Predictive perceptual compression for real time video communication
Approximately 2 degrees in our 140 degree vision span has sharp vision. Many researchers have been fascinated by the idea of eyetracking integrated perceptual compression of an im...
Oleg Komogortsev, Javed I. Khan
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
14 years 8 days ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi