Sciweavers

58 search results - page 2 / 12
» Competitive Freshness Algorithms for Wait-Free Data Objects
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
A Logic Programming Framework for Combinational Circuit Synthesis
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
Paul Tarau, Brenda Luderman
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
14 years 9 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
14 years 8 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
ICDT
2007
ACM
121views Database» more  ICDT 2007»
14 years 1 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin
ECCV
2008
Springer
14 years 9 months ago
Weakly Supervised Object Localization with Stable Segmentations
Multiple Instance Learning (MIL) provides a framework for training a discriminative classifier from data with ambiguous labels. This framework is well suited for the task of learni...
Carolina Galleguillos, Boris Babenko, Andrew Rabin...