Sciweavers

8540 search results - page 1245 / 1708
» The Dynamic Servers Problem
Sort
View
ICASSP
2009
IEEE
15 years 10 months ago
Summarization of large scale social network activity
This paper presents a novel social media summarization framework. Summarizing media created and shared in large scale online social networks unfolds challenging research problems....
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher
3DPVT
2004
IEEE
151views Visualization» more  3DPVT 2004»
15 years 10 months ago
Spacetime-Coherent Geometry Reconstruction from Multiple Video Streams
By reconstructing time-varying geometry one frame at a time, one ignores the continuity of natural motion, wasting useful information about the underlying video-image formation pr...
Marcus A. Magnor, Bastian Goldlücke
ADMA
2006
Springer
137views Data Mining» more  ADMA 2006»
15 years 10 months ago
SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...
Jinlong Wang, Congfu Xu, Hongwei Dan, Yunhe Pan
AINA
2006
IEEE
15 years 10 months ago
Efficient Authentication for Reactive Routing Protocols
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...
Raghav Bhaskar, Javier Herranz, Fabien Laguillaumi...
224
Voted
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 10 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
« Prev « First page 1245 / 1708 Last » Next »