Sciweavers

150 search results - page 6 / 30
» Jogging over a distance: supporting a
Sort
View
ALT
2002
Springer
14 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
SAINT
2003
IEEE
13 years 12 months ago
Mobile Agent based realization of a distance evaluation system
The growth of the Internet has led to new avenues for distance education. A crucial factor for the success of distance education is effective mechanisms for distance evaluation. E...
Vikram Jamwal, Sridhar Iyer
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
14 years 7 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 8 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICNP
1999
IEEE
13 years 11 months ago
WDM Multicasting in IP over WDM Networks
Supporting WDM multicasting in an IP over WDM network poses interesting problems because some WDM switches may be incapable of switching an incoming signal to more than one output...
Chunming Qiao, Myoungki Jeong, Amit Guha, Xijun Zh...