Sciweavers

5149 search results - page 980 / 1030
» Timed Asynchronous Distributed Systems
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 1 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
INFOCOM
2000
IEEE
14 years 1 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
RAID
1999
Springer
14 years 1 months ago
Towards trapping wily intruders in the large
The rapid increase in network bandwidth from mega bits per second to giga bits per second and potentially to tera bits per second, is making it increasingly difficult to carry out...
Glenn Mansfield
CIKM
2008
Springer
13 years 11 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles