Sciweavers

2950 search results - page 81 / 590
» Computing with Infinitely Many Processes
Sort
View
ICIP
2003
IEEE
14 years 3 months ago
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
Rubén Cárdenes, Simon K. Warfield, A...
DBSEC
2007
112views Database» more  DBSEC 2007»
13 years 11 months ago
Reliable Delivery of Event Data from Sensors to Actuators in Pervasive Computing Environments
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...
Sudip Chakraborty, Nayot Poolsappasit, Indrajit Ra...
SAC
2008
ACM
13 years 9 months ago
Continuous k-dominant skyline computation on multidimensional data streams
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates another ...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
INFOCOM
2011
IEEE
13 years 1 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,...
CIIT
2004
13 years 11 months ago
Extraction of students' events for a distant lecture using a computer room
Distance Education Course (DEC) has been becoming more and more popular in many universities with the fast development of the Internet technology. The communication between the te...
Akira Suganuma, Hiroaki Inaki