Sciweavers

683 search results - page 32 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
ICML
2009
IEEE
14 years 8 months ago
Learning nonlinear dynamic models
We present a novel approach for learning nonlinear dynamic models, which leads to a new set of tools capable of solving problems that are otherwise difficult. We provide theory sh...
John Langford, Ruslan Salakhutdinov, Tong Zhang
ICPR
2002
IEEE
14 years 9 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
IPL
2007
101views more  IPL 2007»
13 years 7 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik