Sciweavers

92 search results - page 1 / 19
» Towards a Study of Low-Complexity Graphs
Sort
View
ICALP
2009
Springer
14 years 3 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
JSAC
2011
116views more  JSAC 2011»
12 years 10 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
ICASSP
2011
IEEE
12 years 7 months ago
Towards improving network flow watermarks using the repeat-accumulate codes
Network intruders try to hide their identity by relaying their traf c through a number of intermediate hosts, called stepping stones. Network ow watermarks have been used to detec...
Amir Houmansadr, Nikita Borisov
ENTCS
2006
168views more  ENTCS 2006»
13 years 3 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
13 years 10 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...