Sciweavers

3475 search results - page 634 / 695
» Backbones in Optimization and Approximation
Sort
View
CIKM
2011
Springer
12 years 10 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, ...
CRV
2011
IEEE
278views Robotics» more  CRV 2011»
12 years 10 months ago
Online Visual Vocabularies
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
Yogesh A. Girdhar, Gregory Dudek
INFOCOM
2012
IEEE
12 years 1 months ago
FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
Chad R. Meiners, Eric Norige, Alex X. Liu, Eric To...
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
12 years 1 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 11 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...