Sciweavers

1458 search results - page 12 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
CSC
2008
13 years 9 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
DASFAA
2010
IEEE
195views Database» more  DASFAA 2010»
14 years 1 months ago
Transitivity-Preserving Skylines for Partially Ordered Domains
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Kai Zheng, Jing Yang, Xiaofan...
PVLDB
2008
205views more  PVLDB 2008»
13 years 7 months ago
Making SENSE: socially enhanced search and exploration
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...
CORR
2000
Springer
83views Education» more  CORR 2000»
13 years 8 months ago
Agents of Choice: Tools that Facilitate Notice and Choice about Web Site Data Practices
A variety of tools have been introduced recently that are designed to help people protect their privacy on the Internet. These tools perform many different functions including enc...
Lorrie Faith Cranor
FSS
2008
110views more  FSS 2008»
13 years 8 months ago
Learning valued preference structures for solving classification problems
This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
Eyke Hüllermeier, Klaus Brinker