Sciweavers

16404 search results - page 2400 / 3281
» A set coverage problem
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
PODC
2010
ACM
15 years 11 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
GBRPR
2007
Springer
15 years 11 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal
C5
2004
IEEE
15 years 11 months ago
Scratch: A Sneak Preview
information technologies as "the ability to reformulate knowledge, to express oneself creatively and appropriately, and to produce and generate information (rather than simply...
John Maloney, Leo Burd, Yasmin B. Kafai, Natalie R...
ATAL
2006
Springer
15 years 11 months ago
A context-aware approach for service selection using ontologies
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
Murat Sensoy, Pinar Yolum
« Prev « First page 2400 / 3281 Last » Next »