Sciweavers

528 search results - page 59 / 106
» Fault-tolerant analysis of a class of networks
Sort
View
110
Voted
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
15 years 4 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
125
Voted
ENTCS
2007
158views more  ENTCS 2007»
15 years 19 days ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
CLUSTER
2003
IEEE
15 years 6 months ago
Compiler Optimized Remote Method Invocation
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
Ronald Veldema, Michael Philippsen
115
Voted
PUC
2007
116views more  PUC 2007»
15 years 5 days ago
Periodic properties of user mobility and access-point popularity
Understanding user mobility and its effect on access points (APs) is important in designing location-aware systems and wireless networks. Although various studies of wireless netwo...
Minkyong Kim, David Kotz
81
Voted
MOBICOM
2006
ACM
15 years 6 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...