Sciweavers

52 search results - page 2 / 11
» In Contrast - A Complex Discourse Connective
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Connectivity Properties of Dimension Level Sets
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
Jack H. Lutz, Klaus Weihrauch
INFOCOM
2011
IEEE
12 years 9 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu
EH
2005
IEEE
134views Hardware» more  EH 2005»
13 years 11 months ago
Complexity Metrics for Self-monitoring Impact Sensing Networks
In this paper we describe novel metrics measuring complexity in self-organising networks. The metrics are investigated within the context of decentralised inspections, developed a...
Mikhail Prokopenko, Peter Wang, Don Price
DOCENG
2004
ACM
13 years 10 months ago
Creation of topic map by identifying topic chain in chinese
XML Topic maps enable multiple, concurrent views of sets of information objects and can be used to different applications. For example, thesaurus-like interfaces to corpora, navig...
Ching-Long Yeh, Yi-Chun Chen
MST
2007
138views more  MST 2007»
13 years 4 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke