Sciweavers

143 search results - page 12 / 29
» Sorting and Selection in Posets
Sort
View
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
11 years 11 months ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish
TEC
2002
161views more  TEC 2002»
13 years 8 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
IUI
2009
ACM
14 years 5 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
ICCV
2003
IEEE
14 years 10 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
ORL
1998
68views more  ORL 1998»
13 years 8 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick