Sciweavers

1063 search results - page 144 / 213
» Order and Negation as Failure
Sort
View
DEBS
2011
ACM
14 years 9 months ago
End-to-end reliability for best-effort content-based publish/subscribe networks
When it comes to reliability in distributed publish/subscribe systems, there are two main categories of systems: reliable systems and best-effort systems. The former category giv...
Amirhossein Malekpour, Antonio Carzaniga, Fernando...
EDBT
2011
ACM
254views Database» more  EDBT 2011»
14 years 9 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
SIGIR
2011
ACM
14 years 9 months ago
Active learning to maximize accuracy vs. effort in interactive information retrieval
We consider an interactive information retrieval task in which the user is interested in finding several to many relevant documents with minimal effort. Given an initial documen...
Aibo Tian, Matthew Lease
ICCV
2011
IEEE
14 years 6 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
CIKM
2011
Springer
14 years 6 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...