Sciweavers

209 search results - page 36 / 42
» Computing a Diameter-Constrained Minimum Spanning Tree in Pa...
Sort
View
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
15 years 9 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
PERCOM
2006
ACM
15 years 9 months ago
A Simulation-Based Study on the Throughput Capacity of Topology Control in CSMA/CA Networks
Although it is commonly assumed that the use of topology control can improve the throughput capacity of wireless networks, analytical results on this topic are sometimes contradic...
Douglas M. Blough, Cyrus Harvesf, Giovanni Resta, ...
ETRA
2010
ACM
213views Biometrics» more  ETRA 2010»
14 years 10 months ago
Qualitative and quantitative scoring and evaluation of the eye movement classification algorithms
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
Oleg V. Komogortsev, Sampath Jayarathna, Do Hyong ...
IPPS
2003
IEEE
15 years 2 months ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
PPOPP
2011
ACM
14 years 8 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...