Sciweavers

1105 search results - page 221 / 221
» Linear choosability of graphs
Sort
View
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 1 days ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
TASE
2010
IEEE
13 years 10 hour ago
Analytic Calculus of Response Time in Networked Automation Systems
--This paper presents a novel approach to evaluate the response time in networked automation systems (NAS) that use a client/server protocol. The developments introduced are derive...
Boussad Addad, Said Amari, Jean-Jacques Lesage
INFOCOM
2011
IEEE
12 years 9 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
DIMACS
1996
13 years 6 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin

Publication
400views
13 years 4 days ago
Partitioning Histopathological Images: An Integrated Framework for Supervised Color-Texture Segmentation and Cell Splitting
For quantitative analysis of histopathological images, such as the lymphoma grading systems, quantification of features is usually carried out on single cells before categorizing...
Hui Kong, Metin Gurcan, and Kamel Belkacem-Boussai...