Sciweavers

1441 search results - page 142 / 289
» Multiple instance ranking
Sort
View
SEMWEB
2010
Springer
14 years 8 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 4 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
100
Voted
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
13 years 10 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
PAMI
2012
13 years 17 days ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre
ICIP
1999
IEEE
15 years 11 months ago
Distortion Analyses for Temporal Scalability Coding Techniques
A temporally scalable video coding algorithm allows extraction of video of multiple frame rates from a single coded stream. This paper compares the rate-distortion performance of ...
Sheila S. Hemami