1136 search results - page 192 / 228 » Finding Small Holes |
103
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
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...
127
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
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...
133
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
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 ...
150
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
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...
124
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
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...