Sciweavers

450 search results - page 79 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
KAIS
2010
139views more  KAIS 2010»
14 years 10 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
ICASSP
2009
IEEE
14 years 9 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
EICS
2009
ACM
15 years 6 months ago
Edit, inspect and connect your surroundings: a reference framework for meta-UIs
Discovering and unlocking the full potential of complex pervasive environments is still approached in application-centric ways. A set of statically deployed applications often deļ...
Geert Vanderhulst, Daniel Schreiber, Kris Luyten, ...
HPDC
1998
IEEE
15 years 4 months ago
Metascheduling: A Scheduling Model for Metacomputing Systems
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
Jon B. Weissman
ICPR
2008
IEEE
16 years 1 months ago
Efficient triangulation based on 3D Euclidean optimization
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
Klas Nordberg