Sciweavers

2088 search results - page 405 / 418
» MABAC - Matrix Based Clustering Algorithm
Sort
View
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
14 years 25 days ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
CAV
2007
Springer
164views Hardware» more  CAV 2007»
14 years 18 days ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 8 days ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 4 days ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 10 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal