Sciweavers

2600 search results - page 427 / 520
» Clustering with or without the Approximation
Sort
View
OOPSLA
2005
Springer
14 years 2 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
VLDB
2005
ACM
196views Database» more  VLDB 2005»
14 years 2 months ago
Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
Graham Cormode, S. Muthukrishnan, Irina Rozenbaum
CIKM
2003
Springer
14 years 2 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 2 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan