Sciweavers

2925 search results - page 182 / 585
» Information Complexity of Online Problems
Sort
View
AAAI
2007
15 years 8 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
15 years 8 months ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu
ESWS
2007
Springer
16 years 21 days ago
Pattern-based Ontology Construction
Large and complex enterprise systems face the same kind of information processing problems that exist on the web in general, and constructing an ontology is a crucial part of many ...
Eva Blomqvist
ELPUB
2008
ACM
15 years 8 months ago
African universities in the knowledge economy: a collaborative approach to researching and promoting open communications in high
This paper will describe the informal collaborative approach taken by a group of donor funders and researchers in southern and eastern Africa aimed at consolidating the results an...
Eve Gray, Mark Burke
PODS
2006
ACM
121views Database» more  PODS 2006»
16 years 6 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke