Sciweavers

59 search results - page 8 / 12
» Iterative Lexicographic Path Orders
Sort
View
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 1 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
KDD
2012
ACM
247views Data Mining» more  KDD 2012»
11 years 10 months ago
Integrating meta-path selection with user-guided object clustering in heterogeneous information networks
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potent...
Yizhou Sun, Brandon Norick, Jiawei Han, Xifeng Yan...
ICML
2003
IEEE
14 years 8 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
TSMC
1998
169views more  TSMC 1998»
13 years 7 months ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...
CN
2007
141views more  CN 2007»
13 years 8 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou