Sciweavers

6833 search results - page 1126 / 1367
» Some two-character sets
Sort
View
JCT
2010
79views more  JCT 2010»
15 years 5 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
JUCS
2010
147views more  JUCS 2010»
15 years 5 months ago
Ambient Intelligence: Beyond the Inspiring Vision
Abstract: Ambient Intelligence (AmI) has emerged in the past 10 years as a multidisciplinary field within ubiquitous computing, attracting considerable research, funding and publi...
Rui José, Helena Rodrigues, Nuno Otero
200
Voted
LATINCRYPT
2010
15 years 5 months ago
Mediated Traceable Anonymous Encryption
the full version of the extended abstract which appears in Latincrypt '10 (august 8-11, 2010, Puebla, Mexico) M. Abdalla and P. Barreto Eds., Springer-Verlag, LNCS 6212, pages...
Malika Izabachène, David Pointcheval, Damie...
TCS
2010
15 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
TON
2010
197views more  TON 2010»
15 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
« Prev « First page 1126 / 1367 Last » Next »