Sciweavers

3172 search results - page 208 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 11 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 9 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
HEURISTICS
2006
102views more  HEURISTICS 2006»
15 years 6 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
VRST
1997
ACM
15 years 10 months ago
View volume culling using a probabilistic caching scheme
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
Mel Slater, Yiorgos Chrysanthou
CP
2006
Springer
15 years 10 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh