Sciweavers

2100 search results - page 414 / 420
» Fundamentals of the problem
Sort
View
TON
2002
75views more  TON 2002»
13 years 7 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
INFOCOM
2010
IEEE
13 years 6 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
JKM
2010
131views more  JKM 2010»
13 years 6 months ago
Beyond the ba: managing enabling contexts in knowledge organizations
Purpose – Looking at the practical experience of organizations pursuing knowledge management, it is found that their efforts are primarily focused on creating the conditions and...
Chun Wei Choo, Rivadávia Correa Drummond de...
PRL
2010
158views more  PRL 2010»
13 years 6 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain