Sciweavers

9842 search results - page 1696 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PODS
2010
ACM
173views Database» more  PODS 2010»
15 years 9 months ago
Foundations of schema mapping management
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
HICSS
2002
IEEE
113views Biometrics» more  HICSS 2002»
15 years 9 months ago
Designing and Examining PC to Palm Collaboration
One trend in day-to-day computing involves moving seamlessly from large powerful workstations to small handheld devices. A second trend is continuous collaboration with colleagues...
Ivan Marsic, Allan Meng Krebs, Bogdan Dorohonceanu...
INFOCOM
2002
IEEE
15 years 9 months ago
Optimizing the Topology of Bluetooth Wireless Personal Area Networks
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
Marco Ajmone Marsan, Carla-Fabiana Chiasserini, An...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 9 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
CCA
2009
Springer
15 years 9 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
« Prev « First page 1696 / 1969 Last » Next »