Sciweavers

272 search results - page 43 / 55
» Lazy tree splitting
Sort
View
ICFP
2007
ACM
14 years 7 months ago
User-friendly functional programming for web mashups
MashMaker is a web-based tool that makes it easy for a normal user to create web mashups by browsing around, without needing to type, or plan in advance what they want to do. Like...
Robert Ennals, David Gay
CAV
2010
Springer
225views Hardware» more  CAV 2010»
13 years 11 months ago
Merit: An Interpolating Model-Checker
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...
Nicolas Caniart
CVPR
2008
IEEE
14 years 9 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
14 years 9 months ago
Simple, Robust and Highly Concurrent B-trees with Node Deletion
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
David B. Lomet
MDM
2004
Springer
154views Communications» more  MDM 2004»
14 years 29 days ago
On Bulk Loading TPR-Tree
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
Bin Lin, Jianwen Su