Sciweavers

780 search results - page 40 / 156
» Cost-Sharing Approximations for h
Sort
View
MP
2006
84views more  MP 2006»
13 years 7 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
MOC
2000
77views more  MOC 2000»
13 years 7 months ago
Locking-free finite elements for the Reissner-Mindlin plate
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
Richard S. Falk, Tong Tu
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 5 months ago
Maintaining connectivity in environments with obstacles
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
Onur Tekdas, Patrick A. Plonski, Nikhil Karnad, Vo...
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 10 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li