Sciweavers

1136 search results - page 192 / 228
» Finding Small Holes
Sort
View
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 8 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
MOBIHOC
2008
ACM
14 years 8 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
MOBIHOC
2007
ACM
14 years 8 months ago
Capacity of a wireless ad hoc network with infrastructure
In this paper we study the capacity of wireless ad hoc networks with infrastructure support of an overlay of wired base stations. Such a network architecture is often referred to ...
Benyuan Liu, Patrick Thiran, Donald F. Towsley
POPL
2010
ACM
14 years 6 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 6 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy