Sciweavers

99 search results - page 7 / 20
» Silent stores for free
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 1 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
CIDR
2007
141views Algorithms» more  CIDR 2007»
13 years 8 months ago
Fragmentation in Large Object Repositories
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines n...
Russell Sears, Catharine van Ingen
MVA
1990
13 years 7 months ago
Edge Visibility Regions - A New Representation of the Environment of a Mobile Robot
This paper proposes a novel representation of the free space of mobile robot by distinct, non-overlapping regions called Edge Visibility Regions (EVRs). An algorithm to partition ...
Raj Talluri, J. K. Aggarwal
CSL
2003
Springer
13 years 12 months ago
Modular Semantics and Logics of Classes
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
Bernhard Reus
JMLR
2012
11 years 9 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey