Sciweavers

356 search results - page 27 / 72
» Pairwise Cardinality Networks
Sort
View
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
15 years 12 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
NCA
2007
IEEE
14 years 11 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi
VLDB
2007
ACM
135views Database» more  VLDB 2007»
15 years 6 months ago
Self-Organizing Schema Mappings in the GridVine Peer Data Management System
GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer – where dat...
Philippe Cudré-Mauroux, Suchit Agarwal, Adr...
WS
2005
ACM
15 years 5 months ago
Secure time synchronization service for sensor networks
In this paper, we analyze attacks on existing time synchronization protocols for wireless sensor networks. We propose a secure time synchronization toolbox to counter these attack...
Saurabh Ganeriwal, Srdjan Capkun, Chih-Chieh Han, ...
OL
2011
242views Neural Networks» more  OL 2011»
14 years 6 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...