Sciweavers

112 search results - page 22 / 23
» Approximate methods for convex minimization problems with se...
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 8 months 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, ...
SIGGRAPH
2010
ACM
13 years 5 months ago
Structure-based ASCII art
The wide availability and popularity of text-based communication channels encourage the usage of ASCII art in representing images. Existing tone-based ASCII art generation methods...
Xuemiao Xu, Linling Zhang, Tien-Tsin Wong
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 6 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 10 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
AI
2006
Springer
13 years 6 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...