Sciweavers

635 search results - page 39 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ACTA
2007
85views more  ACTA 2007»
14 years 9 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
EVOW
2010
Springer
15 years 2 months ago
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
Greg Durrett, Muriel Médard, Una-May O'Reil...
FOCS
2006
IEEE
15 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
CVPR
2011
IEEE
14 years 5 months ago
High Level Describable Attributes for Predicting Aesthetics and Interestingness
With the rise in popularity of digital cameras, the amount of visual data available on the web is growing exponentially. Some of these pictures are extremely beautiful and aesthet...
Sagnik Dhar, Vicente Ordonez, Tamara Berg
91
Voted
IJRR
2008
100views more  IJRR 2008»
14 years 9 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle