Sciweavers

32545 search results - page 582 / 6509
» Data Structures and Algorithms
Sort
View
P2P
2006
IEEE
229views Communications» more  P2P 2006»
16 years 1 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
205
Voted
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
EDBT
2004
ACM
313views Database» more  EDBT 2004»
16 years 7 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
COLING
2010
15 years 2 months ago
Self-Annotation for fine-grained geospatial relation extraction
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...
André Blessing, Hinrich Schütze
MICCAI
2010
Springer
15 years 5 months ago
Incorporating Priors on Expert Performance Parameters for Segmentation Validation and Label Fusion: A Maximum a Posteriori STAPL
Abstract. In order to evaluate the quality of segmentations of an image and assess intra- and inter-expert variability in segmentation performance, an Expectation Maximization (EM)...
Olivier Commowick, Simon K. Warfield