4536 search results - page 92 / 908 » Contention-Sensitive Data Structures and Algorithms |
DILS
2005
Springer
13 years 11 months ago
2005
Springer
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
DASFAA
2008
IEEE
14 years 3 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
ER
2004
Springer
14 years 2 months ago
2004
Springer
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...