Sciweavers

1105 search results - page 162 / 221
» Linear choosability of graphs
Sort
View
ER
1999
Springer
108views Database» more  ER 1999»
15 years 4 months ago
Modeling Cyclic Change
Database support of time-varying phenomena typically assumes that entities change in a linear fashion. Many phenomena, however, change cyclically over time. Examples include monsoo...
Kathleen Hornsby, Max J. Egenhofer, Patrick J. Hay...
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 3 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
96
Voted
DCOSS
2008
Springer
15 years 1 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 1 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
WAE
2001
281views Algorithms» more  WAE 2001»
15 years 1 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...