Sciweavers

2168 search results - page 422 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CIKM
2011
Springer
13 years 11 months ago
Tractable XML data exchange via relations
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...
Rada Chirkova, Leonid Libkin, Juan L. Reutter
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
15 years 12 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
SPAA
2009
ACM
16 years 4 days ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
CVPR
2005
IEEE
16 years 1 months ago
Cloth Representation by Shape from Shading with Shading Primitives
Cloth is a complex visual pattern with flexible 3D shape and illumination variations. Computing the 3D shape of cloth from a single image is of great interest to both computer gra...
Feng Han, Song Chun Zhu
CVPR
2005
IEEE
16 years 1 months ago
Bayesian Object Detection in Dynamic Scenes
Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovati...
Yaser Sheikh, Mubarak Shah