Sciweavers

9842 search results - page 1599 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICIP
2001
IEEE
16 years 8 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
ICDE
2008
IEEE
103views Database» more  ICDE 2008»
16 years 8 months ago
Processing Diagnosis Queries: A Principled and Scalable Approach
Abstract-- Many popular Web sites suffer occasional uservisible problems such as slow responses, blank pages or error messages being displayed, items not being added to shopping ca...
Shivnath Babu, Songyun Duan, Kamesh Munagala
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
16 years 8 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
16 years 8 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 8 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
« Prev « First page 1599 / 1969 Last » Next »