Sciweavers

128 search results - page 8 / 26
» Lower bounds for adaptive collect and related objects
Sort
View
PE
2002
Springer
150views Optimization» more  PE 2002»
13 years 7 months ago
Delimiting the range of effectiveness of scalable on-demand streaming
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
Haonan Tan, Derek L. Eager, Mary K. Vernon
ICFCA
2007
Springer
13 years 11 months ago
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
Recent advances in data and knowledge engineering have emphasized the need for formal concept analysis (FCA) tools taking into account structured data. There are a few adaptations ...
Mohamed Rouane Hacene, Marianne Huchard, Amedeo Na...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
DMIN
2006
109views Data Mining» more  DMIN 2006»
13 years 9 months ago
Revised Aggregation-tree Used in Metadata Extraction from SVG Images
Many of the multimedia researchers have focused on the issue of the retrieval of images using indexed image collections. A number of spatial data structures based on Minimum Bound...
Shuju Bai, Abdus Salam, Ebrahim Khosravi
CVPR
2000
IEEE
14 years 9 months ago
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
Zhouchen Lin, Heung-Yeung Shum