Sciweavers

4965 search results - page 249 / 993
» A Simple Abstraction for Data Modeling
Sort
View
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 6 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
16 years 1 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
OOPSLA
2005
Springer
16 years 2 days ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
DBSEC
2007
106views Database» more  DBSEC 2007»
15 years 8 months ago
Enforcing Honesty in Assured Information Sharing Within a Distributed System
The growing number of distributed information systems such as the internet has created a need for security in data sharing. When several autonomous parties attempt to share data, t...
Ryan Layfield, Murat Kantarcioglu, Bhavani M. Thur...
AAAI
2006
15 years 8 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...