Sciweavers

4761 search results - page 307 / 953
» Generalizing Boundary Points
Sort
View
DCG
2007
79views more  DCG 2007»
15 years 6 months ago
Distance Measures for Well-Distributed Sets
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
Alex Iosevich, Michael Rudnev
TIT
2008
100views more  TIT 2008»
15 years 6 months ago
Communication Via Decentralized Processing
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
Amichai Sanderovich, Shlomo Shamai, Yossef Steinbe...
JUCS
2007
98views more  JUCS 2007»
15 years 6 months ago
Random k-GD-Sat Model and its Phase Transition
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
Milena Vujosevic-Janicic, Jelena Tomasevic, Predra...
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
15 years 4 months ago
Online Knowledge-Based Support Vector Machines
Prior knowledge, in the form of simple advice rules, can greatly speed up convergence in learning algorithms. Online learning methods predict the label of the current point and the...
Gautam Kunapuli, Kristin P. Bennett, Amina Shabbee...
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park