Sciweavers

1132 search results - page 113 / 227
» Similarity Graphs
Sort
View
CVPR
2008
IEEE
15 years 12 months ago
Unsupervised modeling of object categories using link analysis techniques
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
Gunhee Kim, Christos Faloutsos, Martial Hebert
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
15 years 10 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
SIES
2007
IEEE
15 years 4 months ago
Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
Bastian Knerr, Martin Holzer 0002, Markus Rupp
CAV
2006
Springer
121views Hardware» more  CAV 2006»
15 years 1 months ago
Deriving Small Unsatisfiable Cores with Dominators
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
Roman Gershman, Maya Koifman, Ofer Strichman
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 1 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski