Sciweavers

2373 search results - page 397 / 475
» Complexities for generalized models of self-assembly
Sort
View
CVPR
2012
IEEE
13 years 6 months ago
Cross-based local multipoint filtering
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
Jiangbo Lu, Keyang Shi, Dongbo Min, Liang Lin, Min...
POPL
2009
ACM
16 years 5 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 4 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
POPL
2008
ACM
16 years 4 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
POPL
2006
ACM
16 years 4 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao