Sciweavers

4110 search results - page 268 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
268
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 7 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
CAV
2009
Springer
212views Hardware» more  CAV 2009»
16 years 7 months ago
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
Susmit Jha, Rhishikesh Limaye, Sanjit A. Seshia
ICPR
2006
IEEE
16 years 7 months ago
A novel SVM Geometric Algorithm based on Reduced Convex Hulls
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
Michael E. Mavroforakis, Margaritis Sdralis, Sergi...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
16 years 4 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
DAC
2003
ACM
16 years 7 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik