Sciweavers

727 search results - page 66 / 146
» Private approximation of search problems
Sort
View
HPCC
2007
Springer
14 years 4 months ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
12 years 14 days ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
PODS
2011
ACM
229views Database» more  PODS 2011»
13 years 26 days ago
On the complexity of privacy-preserving complex event processing
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been ad...
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Nau...
FUIN
2006
98views more  FUIN 2006»
13 years 10 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan