Sciweavers

4004 search results - page 11 / 801
» How Many Packets Can We Encode
Sort
View
ICCNMC
2005
Springer
14 years 2 months ago
Curve-Based Greedy Routing Algorithm for Sensor Networks
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zh...
ER
2007
Springer
70views Database» more  ER 2007»
14 years 2 months ago
As We May Link: A General Metamodel for Hypermedia Systems
Many hypermedia models have been proposed, including those specifically developed to model navigational aspects of web sites. But few hypermedia systems have been implemented base...
Beat Signer, Moira C. Norrie
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 1 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga
DSN
2003
IEEE
14 years 1 months ago
A Study of Packet Delivery Performance during Routing Convergence
Internet measurements have shown that network failures happen frequently, and that existing routing protocols can take multiple seconds, or even minutes, to converge after a failu...
Dan Pei, Lan Wang, Daniel Massey, Shyhtsun Felix W...
DAGSTUHL
2006
13 years 10 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...