Sciweavers

10608 search results - page 1722 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ATAL
2009
Springer
15 years 7 months ago
Analyzing the performance of randomized information sharing
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
CIKM
2009
Springer
15 years 7 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
CONCUR
2009
Springer
15 years 7 months ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
133
Voted
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
15 years 7 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
111
Voted
CSR
2009
Springer
15 years 7 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
« Prev « First page 1722 / 2122 Last » Next »