Sciweavers

197 search results - page 7 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 11 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
SSD
2005
Springer
98views Database» more  SSD 2005»
14 years 25 days ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 11 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ADBIS
2003
Springer
204views Database» more  ADBIS 2003»
13 years 11 months ago
Hierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes
Abstract. Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attribut...
Mikolaj Morzy, Tadeusz Morzy, Alexandros Nanopoulo...
VLSID
2006
IEEE
119views VLSI» more  VLSID 2006»
14 years 7 months ago
Performance and Energy Benefits of Instruction Set Extensions in an FPGA Soft Core
Performance of applications can be boosted by executing application-specific Instruction Set Extensions (ISEs) on a specialized hardware coupled with a processor core. Many commer...
Partha Biswas, Sudarshan Banerjee, Nikil D. Dutt, ...