Sciweavers

570 search results - page 107 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
HPDC
1997
IEEE
13 years 11 months ago
Supporting Parallel Applications on Clusters of Workstations: The Intelligent Network Interface Approach
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
Marcel-Catalin Rosu, Karsten Schwan, Richard Fujim...
MOBICOM
2006
ACM
14 years 1 months ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
MOBICOM
2009
ACM
14 years 2 months ago
Interference management via rate splitting and HARQ over time-varying fading channels
The coexistence of two unlicensed links is considered, where one link interferes with the transmission of the other, over a timevarying, block-fading channel. In the absence of fa...
Marco Levorato, Osvaldo Simeone, Urbashi Mitra
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 7 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish