Sciweavers

874 search results - page 77 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 10 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
SENSYS
2003
ACM
14 years 1 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
ICML
2006
IEEE
14 years 8 months ago
Learning low-rank kernel matrices
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Brian Kulis, Inderjit S. Dhillon, Máty&aacu...
BMCBI
2004
167views more  BMCBI 2004»
13 years 7 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...
EMMCVPR
2007
Springer
13 years 11 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...