Sciweavers

3088 search results - page 281 / 618
» Online Passive-Aggressive Algorithms
Sort
View
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 9 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 9 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
15 years 10 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 8 months ago
Load Distribution Fairness in P2P Data Management Systems
We address the issue of measuring storage, or query load distribution fairness in peer-to-peer data management systems. Existing metrics may look promising from the point of view ...
Theoni Pitoura, Peter Triantafillou
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 7 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman