4744 search results - page 340 / 949 » Connected Computing |
200
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
193
click to vote
ENTER
2007
Springer
15 years 11 months ago
2007
Springer
This paper reports an explanatory study of using Google Map API to develop two destinationspecific tourist information tools: a handheld tour guide and an online trip planner for ...
190
Voted
AAAI
2007
15 years 9 months ago
2007
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
199
Voted
TELETRAFFIC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
158
click to vote
ICCV
2009
IEEE
17 years 13 days ago
2009
IEEE
embedded in a sliding-window scheme. Such exhaustive
search involves massive computation. Efficient Subwindow
Search (ESS) [11] avoids this by means of branch
and bound. However...