Sciweavers

9810 search results - page 1536 / 1962
» Problems, Descriptions and Objects
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICSE
2005
IEEE-ACM
16 years 7 months ago
An architects guide to enterprise application integration with J2EE and .NET
Architects are faced with the problem of building enterprise scale information systems, with streamlined, automated internal business processes and web-enabled business functions,...
Ian Gorton, Anna Liu
PERCOM
2006
ACM
16 years 7 months ago
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
Vinay Kolar, Nael B. Abu-Ghazaleh
DCC
2008
IEEE
16 years 7 months ago
Distributed Multi-stage Coding of Correlated Sources
This paper considers the problem of distributed scalable coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
16 years 5 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
« Prev « First page 1536 / 1962 Last » Next »