Sciweavers

415 search results - page 72 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
STACS
2010
Springer
14 years 25 days ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
P2P
2009
IEEE
231views Communications» more  P2P 2009»
14 years 2 months ago
Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...
CIKM
2010
Springer
13 years 6 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
BIOCOMP
2007
13 years 9 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci