Sciweavers

315 search results - page 41 / 63
» Reasoning about Assignments in Recursive Data Structures
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
15 years 9 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
CORR
2002
Springer
131views Education» more  CORR 2002»
15 years 3 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
COORDINATION
2004
Springer
15 years 9 months ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
DEBU
2006
163views more  DEBU 2006»
15 years 3 months ago
Towards Activity Databases: Using Sensors and Statistical Models to Summarize People's Lives
Automated reasoning about human behavior is a central goal of artificial intelligence. In order to engage and intervene in a meaningful way, an intelligent system must be able to ...
Tanzeem Choudhury, Matthai Philipose, Danny Wyatt,...
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
15 years 1 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...