Sciweavers

1425 search results - page 233 / 285
» Beyond Dependency Graphs
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 2 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
IPPS
2009
IEEE
14 years 2 months ago
Toward adjoinable MPI
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 2 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
MDM
2009
Springer
115views Communications» more  MDM 2009»
14 years 2 months ago
Supporting Contexts for Indoor Navigation Using a Multilayered Space Model
Indoor navigation highly depends on context and requires flexible data structures to support the many use cases and configurations. For example, an indoor navigation system must c...
Thomas Becker, Claus Nagel, Thomas H. Kolbe