Sciweavers

198 search results - page 35 / 40
» On the Lower Bound of Local Optimums in K-Means Algorithm
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 2 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
CORR
2011
Springer
193views Education» more  CORR 2011»
12 years 11 months ago
Gigapixel Binary Sensing: Image Acquisition Using Oversampled One-Bit Poisson Statistics
We study a new gigapixel image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measur...
Feng Yang, Yue M. Lu, Luciano Sbaiz, Martin Vetter...
CLUSTER
2001
IEEE
13 years 11 months ago
Using Multirail Networks in High-Performance Clusters
Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault tolerance of current high-performance parall...
Salvador Coll, Eitan Frachtenberg, Fabrizio Petrin...
PODC
2005
ACM
14 years 27 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder