Sciweavers

1272 search results - page 58 / 255
» The Set Cover with Pairs Problem
Sort
View
136
Voted
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 27 days ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
AAAI
2008
15 years 3 months ago
A Computational Analysis of the Tournament Equilibrium Set
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
84
Voted
KDD
2002
ACM
93views Data Mining» more  KDD 2002»
16 years 1 months ago
Interactive deduplication using active learning
Deduplication is a key operation in integrating data from multiple sources. The main challenge in this task is designing a function that can resolve when a pair of records refer t...
Sunita Sarawagi, Anuradha Bhamidipaty
JMLR
2006
89views more  JMLR 2006»
15 years 22 days ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
87
Voted
CADE
2006
Springer
16 years 1 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown