Sciweavers

11212 search results - page 323 / 2243
» Semi-persistent Data Structures
Sort
View
EMNLP
2009
15 years 4 months ago
Classifier Combination for Contextual Idiom Detection Without Labelled Data
We propose a novel unsupervised approach for distinguishing literal and non-literal use of idiomatic expressions. Our model combines an unsupervised and a supervised classifier. T...
Linlin Li, Caroline Sporleder
PODS
1995
ACM
124views Database» more  PODS 1995»
15 years 10 months ago
Window Query-Optimal Clustering of Spatial Objects
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
ESANN
2006
15 years 8 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
ER
2008
Springer
123views Database» more  ER 2008»
15 years 8 months ago
Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
Lipyeow Lim, Haixun Wang, Min Wang
DBPL
1999
Springer
102views Database» more  DBPL 1999»
15 years 11 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce