Sciweavers

145 search results - page 23 / 29
» Trading convexity for scalability
Sort
View
DEXA
2010
Springer
180views Database» more  DEXA 2010»
13 years 8 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
SIGCOMM
2010
ACM
13 years 7 months ago
Helios: a hybrid electrical/optical switch architecture for modular data centers
The basic building block of ever larger data centers has shifted from a rack to a modular container with hundreds or even thousands of servers. Delivering scalable bandwidth among...
Nathan Farrington, George Porter, Sivasankar Radha...
SIGMETRICS
2002
ACM
133views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
On the stability of network distance estimation
Estimating end-to-end Internet distance can benefit many applications and services, such as efficient overlay construction, overlay routing and location, and peer-topeer systems. ...
Yan Chen, Khian Hao Lim, Randy H. Katz, Chris Over...
ICASSP
2011
IEEE
12 years 11 months ago
Multi image super resolution using compressed sensing
In this paper we present a new compressed sensing model and reconstruction method for multi-detector signal acquisition. We extend the concept of the famous single-pixel camera to...
Torsten Edeler, Kevin Ohliger, Stephan Hussmann, A...
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 9 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young