Sciweavers

2652 search results - page 368 / 531
» Path Differentials and Applications
Sort
View
TPDS
2002
126views more  TPDS 2002»
15 years 4 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
147
Voted
WICON
2010
15 years 2 months ago
TRCCIT: Tunable Reliability with Congestion Control for Information Transport in Wireless Sensor Networks
A core functionality of Wireless Sensor Networks (WSNs) is to transport information from the network to the application/user. The evolvable application reliability requirements and...
Neeraj Suri, Faisal Karim Shaikh, Abdelmajid Kheli...
EJWCN
2011
77views more  EJWCN 2011»
15 years 12 hour ago
Emulating Opportunistic Networks with KauNet Triggers
In opportunistic networks the availability of an end-to-end path is no longer required. Instead opportunistic networks may take advantage of temporary connectivity opportunities. ...
Tanguy Pérennou, Anna Brunstrom, Tomas Hall...
164
Voted
WWW
2006
ACM
16 years 5 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
VLDB
2008
ACM
103views Database» more  VLDB 2008»
16 years 5 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...