Sciweavers

1278 search results - page 27 / 256
» Design and Analysis of Parametric Query Optimization Algorit...
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
15 years 10 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
ICDM
2002
IEEE
123views Data Mining» more  ICDM 2002»
15 years 2 months ago
Towards Automatic Generation of Query Taxonomy: A Hierarchical Query Clustering Approach
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
Shui-Lung Chuang, Lee-Feng Chien
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
15 years 4 months ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
15 years 2 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley