Sciweavers

2609 search results - page 319 / 522
» Optimizing for parallelism and data locality
Sort
View
ADBIS
2007
Springer
171views Database» more  ADBIS 2007»
16 years 13 days ago
Quete: Ontology-Based Query System for Distributed Sources
The exponential growth of the web and the extended use of database management systems in widely distributed information systems has brought to the fore the need for seamless interc...
Haridimos Kondylakis, Anastasia Analyti, Dimitris ...
HOTOS
2003
IEEE
15 years 11 months ago
High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to ...
Charles Blake, Rodrigo Rodrigues
NIPS
2003
15 years 7 months ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek
CSDA
2010
132views more  CSDA 2010»
15 years 6 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
AAAI
2012
13 years 8 months ago
Semi-Supervised Kernel Matching for Domain Adaptation
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
Min Xiao, Yuhong Guo