Sciweavers

4791 search results - page 77 / 959
» Clustering with partial information
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 12 days ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 1 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 4 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ISAAC
2004
Springer
142views Algorithms» more  ISAAC 2004»
15 years 5 months ago
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
Qi Cheng, Ming-Deh A. Huang
CIKM
2008
Springer
15 years 1 months ago
PROQID: partial restarts of queries in distributed databases
In a number of application areas, distributed database systems can be used to provide persistent storage of data while providing efficient access for both local and remote data. W...
Jon Olav Hauglid, Kjetil Nørvåg