Sciweavers

2070 search results - page 158 / 414
» Regret-Minimizing Representative Databases
Sort
View
JCP
2008
171views more  JCP 2008»
15 years 3 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
ML
2006
ACM
131views Machine Learning» more  ML 2006»
15 years 3 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
116
Voted
PRL
2000
148views more  PRL 2000»
15 years 3 months ago
One-dimensional representation of two-dimensional information for HMM based handwriting recognition
: In this study, we introduce a set of one-dimensional features to represent two dimensional shape information for HMM (Hidden Markov Model) based handwritten optical character rec...
Nafiz Arica, Fatos T. Yarman-Vural
153
Voted
VLSISP
1998
114views more  VLSISP 1998»
15 years 3 months ago
A Region-Based Representation of Images in MARS
We study the problem of representing images within a multimedia Database Management System (DBMS), in order to support fast retrieval operations without compromising storage e cien...
Sergio D. Servetto, Yong Rui, Kannan Ramchandran, ...
TKDE
2002
74views more  TKDE 2002»
15 years 3 months ago
Specifying and Enforcing Association Semantics via ORN in the Presence of Association Cycles
Object Relationship Notation (ORN) is a declarative scheme that allows a variety of common relationship types to be conveniently specified to a Database Management System (DBMS), t...
Bryon K. Ehlmann, Gregory A. Riccardi, Naphtali Ri...