Sciweavers

268 search results - page 49 / 54
» Ad Hoc Treebank Structures
Sort
View
ICIP
2004
IEEE
14 years 11 months ago
Rate-distortion analysis of random access for compressed light fields
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
Prashant Ramanathan, Bernd Girod
PODC
2009
ACM
14 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
MOBIHOC
2008
ACM
14 years 9 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 4 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
INFOCOM
2009
IEEE
14 years 4 months ago
Using NEMO to Support the Global Reachability of MANET Nodes
—Mobile Ad hoc Network (MANET) routing protocols have been the focus of an accomplished research effort for many years within the networking community and now the results of this...
Ben McCarthy, Christopher Edwards, Martin Dunmore