Sciweavers

438 search results - page 79 / 88
» date 2009
Sort
View
ASWC
2009
Springer
14 years 8 months ago
Repairing the Missing is-a Structure of Ontologies
Abstract. Developing ontologies is not an easy task and often the resulting ontologies are not consistent or complete. Such ontologies, although often useful, also lead to problems...
Patrick Lambrix, Qiang Liu 0002, He Tan
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
14 years 10 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
INFOCOM
2011
IEEE
14 years 1 months ago
Novasky: Cinematic-quality VoD in a P2P storage cloud
—In this paper, we present Novasky, a real-world Video-on-Demand (VoD) system capable of delivering cinematicquality video streams to end users. The foundation of the Novasky des...
Fangming Liu, Shijun Shen, Bo Li, Baochun Li, Hao ...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
15 years 10 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 4 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer