Sciweavers

846 search results - page 52 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 7 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 1 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
ISPAN
1997
IEEE
13 years 12 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
SMA
2010
ACM
177views Solid Modeling» more  SMA 2010»
13 years 7 months ago
Multi-level grid algorithms for faster molecular energetics
Bio-molecules reach their stable configuration in solvent which is primarily water with a small concentration of salt ions. One approximation of the total free energy of a bio-mol...
Rezaul Alam Chowdhury, Chandrajit L. Bajaj
DCOSS
2010
Springer
13 years 11 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....