Sciweavers

520 search results - page 61 / 104
» Reductions Between Expansion Problems
Sort
View
EMMCVPR
2007
Springer
14 years 3 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
ADHOCNOW
2004
Springer
14 years 2 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
VLDB
2007
ACM
197views Database» more  VLDB 2007»
14 years 9 months ago
Indexable PLA for Efficient Similarity Search
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
Qiuxia Chen, Lei Chen 0002, Xiang Lian, Yunhao Liu...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 2 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
NIPS
2004
13 years 10 months ago
Two-Dimensional Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
Jieping Ye, Ravi Janardan, Qi Li