Sciweavers

11231 search results - page 174 / 2247
» Digging for Data Structures
Sort
View
154
Voted
P2P
2006
IEEE
229views Communications» more  P2P 2006»
15 years 8 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...
146
Voted
EDBT
2004
ACM
313views Database» more  EDBT 2004»
16 years 2 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
115
Voted
COLING
2010
14 years 9 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
81
Voted
ROBOCUP
2005
Springer
102views Robotics» more  ROBOCUP 2005»
15 years 8 months ago
Discovering Relevant Sensor Data by Q-Analysis
Abstract. This paper proposes a novel method for supervised classification based on the methodology of Q-analysis. The classification is based on finding ‘relevant’ structur...
Pejman Iravani
131
Voted
MVA
2010
130views Computer Vision» more  MVA 2010»
15 years 1 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh