Sciweavers

402 search results - page 67 / 81
» Constant-Time Approximation Algorithms via Local Improvement...
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 11 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
EOR
2006
73views more  EOR 2006»
13 years 7 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
INFOCOM
2005
IEEE
14 years 1 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
TOG
2010
106views more  TOG 2010»
13 years 2 months ago
Accelerating spatially varying Gaussian filters
High-dimensional Gaussian filters, most notably the bilateral filter, are important tools for many computer graphics and vision tasks. In recent years, a number of techniques for ...
Jongmin Baek, David E. Jacobs
SRDS
2007
IEEE
14 years 1 months ago
Customizable Fault Tolerance for Wide-Area Replication
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. We present...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...