Sciweavers

900 search results - page 160 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
TCS
2008
13 years 8 months ago
Optimizing deletion cost for secure multicast key management
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Ya...
KI
2010
Springer
13 years 3 months ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...
DAC
2009
ACM
14 years 9 months ago
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
Wenwen Chai, Dan Jiao, Cheng-Kok Koh
ICASSP
2009
IEEE
14 years 3 months ago
Benchmarking flexible adaptive time-frequency transforms for underdetermined audio source separation
We have implemented several fast and flexible adaptive lapped orthogonal transform (LOT) schemes for underdetermined audio source separation. This is generally addressed by time-...
Andrew Nesbit, Emmanuel Vincent, Mark D. Plumbley
SIGCOMM
2009
ACM
14 years 3 months ago
Beyond friendship graphs: a study of user interactions in Flickr
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
Masoud Valafar, Reza Rejaie, Walter Willinger