Sciweavers

8431 search results - page 1216 / 1687
» Algorithmically Independent Sequences
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
15 years 8 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
ICALP
2010
Springer
15 years 8 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
CLEF
2008
Springer
15 years 8 months ago
Exploiting Term Co-occurrence for Enhancing Automated Image Annotation
This paper describes an application of statistical co-occurrence techniques that built on top of a probabilistic image annotation framework is able to increase the precision of an ...
Ainhoa Llorente, Simon E. Overell, Haiming Liu 000...
CP
2008
Springer
15 years 8 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
« Prev « First page 1216 / 1687 Last » Next »