Sciweavers

4117 search results - page 318 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
ICDT
2009
ACM
119views Database» more  ICDT 2009»
16 years 7 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
VLSID
2009
IEEE
107views VLSI» more  VLSID 2009»
16 years 7 months ago
Temperature Aware Scheduling for Embedded Processors
Power density has been increasing at an alarming rate in recent processor generations resulting in high on-chip temperature. Higher temperature results in poor reliability and inc...
Ramkumar Jayaseelan, Tulika Mitra
PODS
2005
ACM
147views Database» more  PODS 2005»
16 years 7 months ago
Peer data exchange
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
Ariel Fuxman, Phokion G. Kolaitis, Renée J....
EDBT
2004
ACM
162views Database» more  EDBT 2004»
16 years 7 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu