Sciweavers

236 search results - page 23 / 48
» Binary Partitions Revisited
Sort
View
67
Voted
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
15 years 5 months ago
Visual Segment Tree Creation for MPEG-7 Description Schemes
This paper deals with the creation of visual segment trees involved in MPEG-7 Description Schemes. After a brief overview of MPEG7 description schemes in general and of the Segmen...
Philippe Salembier, Joan Llach, Luis Garrido
TIT
2010
124views Education» more  TIT 2010»
14 years 7 months ago
On the capacity of the precision-resolution system
Arguably, the most prominent constrained system in storage applications is the (d; k)-run-length limited (RLL) system, where every binary sequence obeys the constraint that every t...
Moshe Schwartz, Jehoshua Bruck
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 1 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
115
Voted
ICIP
2009
IEEE
14 years 10 months ago
Learning weighted similarity measurements for unconstrained face recognition
Unconstrained face recognition is the problem of deciding if an image pair is showing the same individual or not, without having class specific training material or knowing anythi...
Andre Störmer, Gerhard Rigoll
107
Voted
COLING
2010
14 years 7 months ago
Sentiment Classification and Polarity Shifting
Polarity shifting marked by various linguistic structures has been a challenge to automatic sentiment classification. In this paper, we propose a machine learning approach to inco...
Shoushan Li, Sophia Yat Mei Lee, Ying Chen, Chu-Re...