Sciweavers

2280 search results - page 361 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 5 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 4 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
IPSN
2009
Springer
15 years 11 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
SCAM
2006
IEEE
15 years 10 months ago
SMART C: A Semantic Macro Replacement Translator for C
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Matthew Jacobs, E. Christopher Lewis
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
15 years 10 months ago
Electronic Trading in Order-Driven Markets: Efficient Execution
In this paper, we address the importance of efficient execution in electronic markets. Due to intense competition for profit opportunities, trading costs can represent a significa...
Yuriy Nevmyvaka, Michael S. Kearns, Amy Papandreou...