69 search results - page 9 / 14 » Maximal Intersection Queries in Randomized Input Models |
PKDD
2007
Springer
15 years 6 months ago
2007
Springer
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
92
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
AAAI
2008
15 years 2 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
102
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
In the task of visual object categorization, semantic context can play the very important role of reducing ambiguity in objects' visual appearance. In this work we propose to...
112
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...