Sciweavers

5138 search results - page 84 / 1028
» Low-Entropy Set Selection.
Sort
View
INFOCOM
2012
IEEE
13 years 8 months ago
Harnessing Internet topological stability in Thorup-Zwick compact routing
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
Stephen D. Strowes, Colin Perkins
ISEC
2001
Springer
180views ECommerce» more  ISEC 2001»
15 years 10 months ago
i-Cube: A Tool-Set for the Dynamic Extraction and Integration of Web Data Content
Over the past decade the Internet has evolved into the largest public community in the world. It provides a wealth of data content and services in almost every field of science, t...
Frankie Poon, Kostas Kontogiannis
IDA
1997
Springer
15 years 10 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
AVI
2010
15 years 7 months ago
Setting the bar for set-valued attributes
In this paper, we present an interactive visualization method for set-valued attributes that maintains the advantages of item-oriented views and interactions found in parallel mul...
Kent Wittenburg
ECRTS
2010
IEEE
15 years 7 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...