Sciweavers

4192 search results - page 273 / 839
» Efficient testing of groups
Sort
View
COMGEO
2006
ACM
15 years 6 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
JSAC
2008
165views more  JSAC 2008»
15 years 6 months ago
Energy-Efficient Routing Schemes for Underwater Acoustic Networks
Interest in underwater acoustic networks has grown rapidly with the desire to monitor the large portion of the world covered by oceans. Fundamental differences between underwater a...
Michele Zorzi, Paolo Casari, Nicola Baldo, Albert ...
CCE
2004
15 years 6 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
CGF
2002
149views more  CGF 2002»
15 years 6 months ago
Using Perceptual Texture Masking for Efficient Image Synthesis
Texture mapping has become indispensable in image synthesis as an inexpensive source of rich visual detail. Less obvious, but just as useful, is its ability to mask image errors d...
Bruce Walter, Sumanta N. Pattanaik, Donald P. Gree...
IJPP
2002
107views more  IJPP 2002»
15 years 6 months ago
Efficiently Adapting Java Binaries in Limited Memory Contexts
This paper presents a compilation framework that allows executable code to be shared across different Java Virtual Machine (JVM) instances. All fully compliant JVMs that target se...
Pramod G. Joisha, Samuel P. Midkiff, Mauricio J. S...