Sciweavers

1478 search results - page 6 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
CIVR
2010
Springer
204views Image Analysis» more  CIVR 2010»
13 years 10 months ago
Utilizing related samples to learn complex queries in interactive concept-based video search
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
Jin Yuan, Zheng-Jun Zha, Zhengdong Zhao, Xiangdong...
BMCBI
2010
177views more  BMCBI 2010»
13 years 7 months ago
Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
Aydin Albayrak, Hasan H. Otu, Ugur O. Sezerman
DEBS
2008
ACM
13 years 8 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 1 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
ICALP
2003
Springer
14 years 3 days ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen