Sciweavers

7015 search results - page 931 / 1403
» Approximation algorithms for co-clustering
Sort
View
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 10 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
BMVC
2002
15 years 9 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
ATVA
2008
Springer
99views Hardware» more  ATVA 2008»
15 years 9 months ago
Model Checking Recursive Programs with Exact Predicate Abstraction
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
Arie Gurfinkel, Ou Wei, Marsha Chechik
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
BNCOD
2007
121views Database» more  BNCOD 2007»
15 years 8 months ago
Indexing and Searching XML Documents Based on Content and Structure Synopses
We present a novel framework for indexing and searching schema-less XML documents based on concise summaries of their structural and textual content. Our search query language is X...
Weimin He, Leonidas Fegaras, David Levine