Sciweavers

1187 search results - page 68 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
15 years 2 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
INFOCOM
2010
IEEE
14 years 7 months ago
Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
János Tapolcai, Lajos Rónyai, Pin-Ha...
ISCAS
2002
IEEE
65views Hardware» more  ISCAS 2002»
15 years 2 months ago
Maximum achievable energy reduction using coding with applications to deep sub-micron buses
: In this work, the problem of the computation of the minimum energy per bit required for communicating through deep sub-micron buses at a given bit rate is solved with an explicit...
Paul-Peter Sotiriadis, Anantha Chandrakasan, Vahid...
EDBT
2004
ACM
131views Database» more  EDBT 2004»
15 years 10 months ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
BROADNETS
2007
IEEE
15 years 4 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun