Sciweavers

380 search results - page 40 / 76
» Instance Matching with COMA
Sort
View
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
14 years 9 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 8 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ICDE
2006
IEEE
115views Database» more  ICDE 2006»
14 years 1 months ago
Integration Workbench: Integrating Schema Integration Tools
A key aspect of any data integration endeavor is establishing a transformation that translates instances of one or more source schemata into instances of a target schema. This sch...
Peter Mork, Arnon Rosenthal, Leonard J. Seligman, ...
ICMCS
2005
IEEE
150views Multimedia» more  ICMCS 2005»
14 years 1 months ago
MPEG-7 MDS-Based Application Specific Metadata Model for Personalized Multi-Service Access in a DTV Broadcast Environment
The paper presents an MPEG-7 Multimedia Description Schemes (MDS)-based metadata and user profile model used within an enhanced DTV environment for semantic annotation and person...
Sofia Tsekeridou
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 1 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking