Sciweavers

2926 search results - page 530 / 586
» Partially Optimal Routing
Sort
View
112
Voted
MICCAI
2006
Springer
16 years 1 months ago
A Landmark-Based Brain Conformal Parametrization with Automatic Landmark Tracking Technique
Abstract. In this paper, we present algorithms to automatically detect and match landmark curves on cortical surfaces to get an optimized brain conformal parametrization. First, we...
Lok Ming Lui, Yalin Wang, Tony F. Chan, Paul M. Th...
223
Voted
POPL
2004
ACM
16 years 1 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
177
Voted
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 27 days ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
MOBIHOC
2003
ACM
16 years 10 days ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
106
Voted
SPAA
2009
ACM
15 years 10 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald