Sciweavers

415 search results - page 58 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
14 years 3 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
MUE
2008
IEEE
173views Multimedia» more  MUE 2008»
14 years 3 months ago
Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing
In this paper we propose Rank-Based Broadcast (RBB) algorithm using High Order Markov Chain (HOMC) with weight values in mobile p2p ad-hoc networks (MOPNET) for ubiquitous. RBB us...
Do-Hoon Kim, Myoung Rak Lee, Longzhe Han, Hoh Pete...
ASPDAC
2001
ACM
102views Hardware» more  ASPDAC 2001»
14 years 19 days ago
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...
COLT
1993
Springer
14 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 3 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta